Supereulerian line graphs

DOI10.1016/J.DISC.2021.112707zbMath1481.05091OpenAlexW3213475073MaRDI QIDQ2065881

Yingmin Shangguan, Limning Xiong

Publication date: 13 January 2022

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

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

zbMATH Keywords

line graphreduction methodsupereulerian graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs
• On dominating and spanning circuits in graphs
• On a closure concept in claw-free graphs
• A reduction method to find spanning Eulerian subgraphs
• On Eulerian and Hamiltonian Graphs and Line Graphs

This page was built for publication: Supereulerian line graphs