Computation of total chromatic number for certain convex polytope graphs

DOI10.14317/JAMI.2024.567MaRDI QIDQ6619422

Gitanjali Jayaraman, A. Punitha

Publication date: 15 October 2024

Published in: Journal of Applied Mathematics \& Informatics (Search for Journal in Brave)

zbMATH Keywords

total chromatic numbertotal coloringconvex polytope graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On families of convex polytopes with constant metric dimension
• The total coloring of a multigraph with maximal degree 4
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Equitable coloring of some convex polytope graphs
• Total colourings of graphs
• On the total coloring of certain graphs
• On the total coloring of planar graphs.
• The open-locating-dominating number of some convex polytopes
• TOTAL COLORING OF CERTAIN GRAPHS
• The Colour Numbers of Complete Graphs
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• On Total Chromatic Number of a Graph

This page was built for publication: Computation of total chromatic number for certain convex polytope graphs

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