Closure concepts for claw-free graphs


Broersma, H.J. and Trommel, H. (1998) Closure concepts for claw-free graphs. Discrete Mathematics, 185 (1-3). pp. 231-238. ISSN 0012-365X

[img] PDF
Restricted to UT campus only
: Request a copy
Abstract:Recently, Ryjácek introduced an interesting new closure concept for claw-free graphs, and used it to prove that every nonhamiltonian claw-free graph is a spanning subgraph of a nonhamiltonian line graph (of a triangle-free graph). We discuss the relationship between Ryjácek's closure and the K4-closure introduced by the first author. Our main result deals with a variation on the K4-closure. It implies a simpler proof of Ryjá ek's closure theorem, and yields a more general closure concept which is not restricted to claw-free graphs only.
Item Type:Article
Copyright:© 1998 Elsevier
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 140550