95 search results - page 8 / 19 » Hamiltonian-Laceability of Star Graphs |
160
click to vote
ENDM
2002
15 years 5 months ago
2002
A graph G homogeneously embeds in a graph H if for every vertex x of G and every vertex y of H there is an induced copy of G in H with x at y. The graph G uniformly embeds in H if...
153
click to vote
WG
2010
Springer
15 years 4 months ago
2010
Springer
The vertex colouring problem is known to be NP-complete in the class of triangle-free graphs. Moreover, it remains NP-complete even if we additionally exclude a graph F which is n...
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
