Rainbow subgraphs in distance-colored graphs
Jones, Ryan; Kolasinski, Kyle; Zhang, Ping
Congr. Numer. 207, 7-21 (2011).
On the edge-balanced index sets of complete bipartite graphs
Krop, Elliot; Sikes, Keli
Congr. Numer. 207, 23-32 (2011).
Towards finite characterization of planar-emulable non-projective graphs
Derka, Martin
Congr. Numer. 207, 33-68 (2011).
Improved sliding shortest path algorithm: performance analysis
Carter, Henry; Bhandari, Ramesh
Congr. Numer. 207, 69-81 (2011).
Eigenvalue statistics of one-face maps
McNicholas, E. M.
Congr. Numer. 207, 83-95 (2011).
Continuous Rado numbers for the equation a1x1+a2x2+⋯+am−1xm−1+c=xm
Schaal, Daniel; Zinter, Melanie
Congr. Numer. 207, 97-104 (2011).
Meaningfulness of list T-colorings of graphs
Tesman, Barry
Congr. Numer. 207, 105-109 (2011).
Computing network reliability coefficients
Beichl, Isabel; Moseman, Elizabeth; Sullivan, Francis
Congr. Numer. 207, 111-127 (2011).
Counting the leaves of trees
Cloteaux, Brian; Valentin, Luis Alejandro
Congr. Numer. 207, 129-139 (2011).
Matroid automorphisms of the root system H4
Bao, Chencong; Friedman-Gerlicz, Camila; Gordon, Gary; McGrath, Peter; Vega, Jessica
Congr. Numer. 207, 141-160 (2011).
Decompositions of complete graphs into kayak paddles with two odd cycles
Froncek, Dalibor; Tollefson, Leah
Congr. Numer. 207, 161-169 (2011).
Edge-sensitivity of the Grundy number
Clark, Sally; Johnson, Pete; Walsh, Matt
Congr. Numer. 207, 171-180 (2011).
Counting irreducible double occurrence words
Burns, Jonathan; Muche, Tilahun
Congr. Numer. 207, 181-196 (2011).