A sufficient condition for a regular graph to be class 1

DOI10.1002/JGT.3190170607MaRDI QIDQ4285592zbMATH OpenOpenAlexFDO

Authors Cheng Zhao, A. J. W. Hilton

Publication date 24 March 1994

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

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

zbMATH Keywords

1-factorizableclass 1coremaximum degreePetersen graphregular graphsimple graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 927053
• A Sufficient Condition for a Graph to be the Core of a Class 2 Graph
• Cores of class II graphs
• scientific article; zbMATH DE number 1990720
• Class one graphs

Cited in

(6)

• The chromatic index of a claw-free graph whose core has maximum degree 2
• On the size of graphs of class 2 whose cores have maximum degree two
• Some criteria for a graph to be class 1
• scientific article; zbMATH DE number 1990720 (Why is no real title available?)
• A Sufficient Condition for a Graph to be the Core of a Class 2 Graph
• The chromatic index of a graph whose core is a cycle of order at most 13

This page was built for publication: A sufficient condition for a regular graph to be class 1

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