Iterated line graphs are maximally ordered

DOI10.1002/JGT.20152MaRDI QIDQ5471014zbMATH OpenOpenAlexFDO

Authors Martin Knor, Ludovit Niepel

Publication date 6 June 2006

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20152

zbMATH Keywords

\(k\)-ordered graphcyclesgraph dynamicsminorseparation

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• k-ordered hamiltonicity of iterated line graphs
• Maximum degree growth of the iterated line graph
• Iterated k-line graphs
• Linkability in iterated line graphs
• Connectivity of iterated line graphs

Cites work

• Linear forests and ordered cycles

Cited in

(8)

• k-ordered hamiltonicity of iterated line graphs
• Maximum degree growth of the iterated line graph
• On the dominating (induced) cycles of iterated line graphs
• Index of parameters of iterated line graphs
• Which line-graphs are perfectly orderable?
• A Note on the Order of Iterated Line Digraphs
• The Wiener index in iterated line graphs
• The existence of even factors in iterated line graphs

This page was built for publication: Iterated line graphs are maximally ordered

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5471014)