scientific article; zbMATH DE number 1135746

MaRDI QIDQ4381214zbMATH OpenFDO

Authors Honghui Wan, Zaishu Cheng

Publication date 3 May 1998

zbMATH Keywords

1-factorizable graphClass 1classificationedge colouringVizing's theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
• scientific article; zbMATH DE number 1159503
• A note on graphs of class I
• Some criteria for a graph to be class 1
• Class one graphs

Cited in

(12)

• Class one graphs
• Graphs of \(f\)-class 1
• A note on graphs of class I
• A note on class one graphs with maximum degree six
• A classification of all 1-Salem graphs
• scientific article; zbMATH DE number 3863252 (Why is no real title available?)
• Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
• scientific article; zbMATH DE number 3946161 (Why is no real title available?)
• scientific article; zbMATH DE number 1159503 (Why is no real title available?)
• Some criteria for a graph to be class 1
• scientific article; zbMATH DE number 840690 (Why is no real title available?)
• Some new results in the Alcuin number of graphs

This page was built for publication:

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