Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A study of the total chromatic number of equibipartite graphs

From MaRDI portal
Publication:1584229
Jump to:navigation, search

DOI10.1016/S0012-365X(97)00160-XzbMath0958.05052OpenAlexW2061294131MaRDI QIDQ1584229

Hung-Lin Fu, Chun-Kan Cheng, Kuo-Ching Huang, Bor-Liang Chen

Publication date: 2 November 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00160-x


zbMATH Keywords

total chromatic numberbiconformability conjectureequibipartite graphs


Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)


Related Items (1)

Total colorings of equibipartite graphs




Cites Work

  • Unnamed Item
  • Zero-one matrices with zero trace
  • The total chromatic number of nearly complete bipartite graphs
  • On the total coloring of certain graphs
  • The Colour Numbers of Complete Graphs
  • Complementary Graphs and Edge Chromatic Numbers




This page was built for publication: A study of the total chromatic number of equibipartite graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1584229&oldid=13876300"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 02:12.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki