scientific article; zbMATH DE number 1286508

DOI10.1002/(SICI)1097-0118(199811)29:3%3C133::AID-JGT1%3E3.0.CO;2-RMaRDI QIDQ4242957zbMATH OpenFDO

Authors Baogang Xu

Publication date 31 August 1999

Full work available at URL https://doi.org/10.1002/(SICI)1097-0118(199811)29:3%3C133::AID-JGT1%3E3.0.CO;2-R

zbMATH Keywords

bipartite graphmajor vertexmatchingtotal chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Two sufficient conditions for a graph to be type 1.
• scientific article; zbMATH DE number 4108788
• The total chromatic number of regular graphs whose complement is bipartite

Cited in

(7)

• Total colorings of equibipartite graphs
• Generalization of two results of Hilton on total-colourings of a graph
• The total chromatic number of some bipartite graphs.
• A necessary and sufficient eigenvector condition for a connected graph to be bipartite
• scientific article; zbMATH DE number 3863255 (Why is no real title available?)
• The total chromatic number of some bipartite graphs
• Two sufficient conditions for a graph to be type 1.

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 Q4242957)