Generalizing Bondy’s theorems on sufficient conditions for Hamiltonian properties
Bode, Jens-P.; Kemnitz, Arnfried; Schiermeyer, Ingo; Schwarz, Anika
Congr. Numer. 203, 5-13 (2010).
Graffiti.pc on the 2-domination number of a graph
DeLa Viña, Ermelinda; Larson, Craig E.; Pepper, Ryan; Waller, Bill
Congr. Numer. 203, 15-32 (2010).
Proper rainbow Ramsey numbers
Stevens, Gary E.; Woskoff, Kaitlin
Congr. Numer. 203, 33-41 (2010).
A surgery reducing the number of spanning trees for threshold graphs by creating a bridge
Houck, Michelle L.; Saccoman, John T.
Congr. Numer. 203, 43-55 (2010).
Splittable triplewhist tournament designs
Berman, David R.; Finizio, Norman J.
Congr. Numer. 203, 57-64 (2010).
Crossing numbers for certain distance graphs
Harborth, Heiko; Thürmann, Christian
Congr. Numer. 203, 65-74 (2010).
Equilibrium of shortest path load in ring networks
Hedetniemi, Jason; Hutson, Kevin R.
Congr. Numer. 203, 75-95 (2010).
Tour sets and tour vertices in graphs with no end-vertices
Johns, Garry L.; Vautaw, William R.
Congr. Numer. 203, 97-104 (2010).
A note on the edge-balance index sets for graphs
Chung, Ping-Tsai; Lee, Sin-Min
Congr. Numer. 203, 105-129 (2010).
A note on the surface area of the Cartesian product graphs
Cheng, E.; Qiu, K.; Chen, Z. Z.
Congr. Numer. 203, 131-137 (2010).
Representing 3-trees as unit rectangle-visibility graphs
Dean, Alice M.; Hutchinson, Joan P.
Congr. Numer. 203, 139-160 (2010).
Non-existence of a nearly extremal family of edge-regular graphs
Johnson, P. D. jun.; Roblee, K. J.
Congr. Numer. 203, 161-166 (2010).
Vertex rainbow numbers for cube graphs
Bode, Jens-P.; Harborth, Heiko; Möller, Meinhard; Nienborg, Hauke
Congr. Numer. 203, 167-174 (2010).
The improved sliding shortest path algorithm
Bhandari, Ramesh
Congr. Numer. 203, 175-192 (2010).
A new Catalan convolution identity
Larcombe, Peter J.; French, David R.
Congr. Numer. 203, 193-211 (2010).
Maximum size circuit Pairs in matroids
McMurray, Nolan B. jun.; Reid, Talmage J.; Williams, Bryan
Congr. Numer. 203, 213-219 (2010).