On efficient total colorings of regular graphs

DOI10.61091/CN236-01MaRDI QIDQ6898201zbMATH OpenFDO

Authors Italo J. Dejter

Publication date 18 November 2025

Published in Congressus Numerantium (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.61091/CN236-01

zbMATH Keywords

efficient dominating setgeneralized Petersen graphHamming shellregular graphstar transposition graphtotal coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites work

• A concise proof for total coloring subcubic graphs
• Determining the total colouring number is NP-hard
• Efficient dominating sets in Cayley graphs.
• Efficient dominating sets in circulant graphs
• Efficient domination in cubic vertex-transitive graphs
• Equitable factorizations of Hamming shells
• Highly symmetric subgraphs of hypercubes
• scientific article; zbMATH DE number 3349876 (Why is no real title available?)
• Links between two semisymmetric graphs on 112 vertices via association schemes
• Nonexistence of efficient dominating sets in the Cayley graphs generated by transposition trees of diameter 3
• On an estimate of the chromatic class of a \(p\)-graph
• On the total coloring of certain graphs
• On the total coloring of generalized Petersen graphs
• On Total Chromatic Number of a Graph
• Total coloring of regular graphs of girth = degree + 1.
• Total colorings-a survey
• Worst-case efficient dominating sets in digraphs

This page was built for publication: On efficient total colorings of regular graphs

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