Line graphs and forbidden induced subgraphs

DOI10.1006/jctb.2000.2019zbMath1026.05093OpenAlexW2110972347MaRDI QIDQ1850532

Hong-Jian Lai, Ľubomír Šoltés

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4fc861b1c6e919d99bfd3a7a4119d15229c0b03d

zbMATH Keywords

characterizationforbidden induced subgraphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (7)

Hamiltonian claw-free graphs and \(o\)-heavy graphs involving induced cycles ⋮ Graph limits and hereditary properties ⋮ A decidability result for the dominating set problem ⋮ Clique family inequalities for the stable set polytope of quasi-line graphs. ⋮ Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs ⋮ Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs ⋮ The feasibility problem for line graphs

Cites Work

• On hamiltonian line graphs and connectivity
• 9-connected claw-free graphs are Hamilton-connected
• Parallel concepts in graph theory
• Forbidden induced subgraphs for line graphs
• On a closure concept in claw-free graphs
• Characterizing forbidden pairs for hamiltonian properties
• Graphe représentatif des arêtes d'un multigraphe
• Hamiltonian results inK1,3-free graphs
• Generalized line graphs
• Reflections on graph theory
• A generalization of line graphs: (X, Y)-intersection graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Line graphs and forbidden induced subgraphs