Total chromatic number of honeycomb network
From MaRDI portal
Publication:5034972
DOI10.1080/09720529.2019.1677309zbMath1487.05100OpenAlexW3008415659MaRDI QIDQ5034972
Publication date: 21 February 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2019.1677309
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- The total chromatic number of split-indifference graphs
- A larger family of planar graphs that satisfy the total coloring conjecture
- Total chromatic numbers
- The total coloring of a multigraph with maximal degree 4
- The total chromatic number of regular graphs whose complement is bipartite
- Total chromatic number of one kind of join graphs
- On the total coloring of certain graphs
- On the total coloring of planar graphs.
- On Total Chromatic Number of a Graph
- A textbook of graph theory
This page was built for publication: Total chromatic number of honeycomb network