The core conjecture of Hilton and Zhao

DOI10.1016/j.jctb.2024.01.004arXiv2108.04399WikidataQ129357896 ScholiaQ129357896MaRDI QIDQ6196157

Guangming Jing, Yan Cao, Guantao Chen, Songling Shan

Publication date: 14 March 2024

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

Full work available at URL: https://arxiv.org/abs/2108.04399

zbMATH Keywords

lollipopoverfull graphKierstead pathmultifanpseudo-multifan

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new method of proving theorems on chromatic index
• The chromatic index of a graph whose core has maximum degree two
• Colouring the petals of a graph
• The NP-Completeness of Edge-Coloring
• The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: The core conjecture of Hilton and Zhao