483 search results - page 8 / 97 » On perfectness of sums of graphs |
ARSCOM
2007
13 years 7 months ago
2007
For any h ∈ N, a graph G = (V, E) is said to be h-magic if there exists a labeling l : E(G) → Zh − {0} such that the induced vertex labeling l+ : V (G) → Zh defined by l+ ...
COCO
2010
Springer
13 years 4 months ago
2010
Springer
An even cycle in a graph is called nice by Lov
DM
2000
13 years 7 months ago
2000
We determine the order of growth of the worst-case number of perfect subgraphs needed to cover an n-vertex graph.
DM
2006
13 years 7 months ago
2006
The resonance graph R(B) of a benzenoid graph B has the perfect matchings of B as vertices, two perfect matchings being adjacent13 if their symmetric difference forms the edge set...
ALGORITHMICA
2004
13 years 7 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...