102 search results - page 2 / 21 » Balanced Paths in Colored Graphs |
JGT
2007
14 years 9 months ago
2007
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
COMBINATORICS
2007
14 years 9 months ago
2007
88
Voted
JGT
2006
14 years 9 months ago
2006
An edge-colored graph H is properly colored if no two adjacent edges of H have the same color. In 1997, J. Bang-Jensen and G. Gutin conjectured that an edgecolored complete graph ...
JGT
2010
14 years 8 months ago
2010
WALCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number i...