Total chromatic number of honeycomb network

DOI10.1080/09720529.2019.1677309MaRDI QIDQ5034972zbMATH OpenOpenAlexFDO

Authors S. Shyama, M. R. Chithra

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

zbMATH Keywords

honeycomb networktotal chromatic numbertotal coloringtotal coloring conjecture

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• scientific article; zbMATH DE number 4108788
• Total Chromatic Number of Graphs of Order 2n + l having Maximum Degree 2n − 1
• scientific article; zbMATH DE number 98760
• Recent developments in total colouring
• scientific article; zbMATH DE number 1852751

Cites work

• A larger family of planar graphs that satisfy the total coloring conjecture
• A textbook of graph theory
• On the total coloring of certain graphs
• On the total coloring of planar graphs.
• On Total Chromatic Number of a Graph
• The total chromatic number of regular graphs whose complement is bipartite
• The total chromatic number of split-indifference graphs
• The total coloring of a multigraph with maximal degree 4
• Total chromatic number of one kind of join graphs
• Total chromatic numbers

Cited in

(3)

• scientific article; zbMATH DE number 6002502 (Why is no real title available?)
• Topological properties and computation of silicate networks using graph-invariants
• Unraveling the enigmatic irregular coloring of honeycomb networks

This page was built for publication: Total chromatic number of honeycomb network

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