Linkability in iterated line graphs

DOI10.1016/j.disc.2005.11.018zbMath1092.05062OpenAlexW2030069687MaRDI QIDQ2488940

Martin Knor, Thomas Böhme, L'udovít Niepel

Publication date: 16 May 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.018

zbMATH Keywords

minorconnectivity

Mathematics Subject Classification ID

Graph minors (05C83)

Related Items

Index of parameters of iterated line graphs ⋮ The existence of even factors in iterated line graphs ⋮ On the dominating (induced) cycles of iterated line graphs

Cites Work

• Maximum degree growth of the iterated line graph
• An improved linear edge bound for graph linkages
• Hamiltonian iterated line graphs
• Graph minors. XIII: The disjoint paths problem
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
• Highly linked graphs
• On Sufficient Degree Conditions for a Graph to be $k$-linked
• On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
• Connectivity of iterated line graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item