Total chromatic number of one kind of join graphs
From MaRDI portal
Publication:2501562
DOI10.1016/j.disc.2006.03.056zbMath1101.05030MaRDI QIDQ2501562
Publication date: 14 September 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.03.056
05C15: Coloring of graphs and hypergraphs
Related Items
Total chromatic number of honeycomb network, Edge-colouring and total-colouring chordless graphs, Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs, Total chromatic number of unichord-free graphs, Equitable total coloring of \(C_m\square C_n\), Total chromatic number of {square,unichord}-free graphs, A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs
Cites Work