2 search results - page 1 / 1 » Chromatic Equivalence of Generalized Ladder Graphs |
77
Voted
ARSCOM
2005
14 years 10 months ago
2005
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of these graphs to be chromatically equivalent is proven. In addition a formula for...
82
Voted
JGT
2006
14 years 10 months ago
2006
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...