Equitable total coloring of corona of cubic graphs
From MaRDI portal
Publication:2042627
DOI10.7151/dmgt.2245zbMath1468.05076arXiv1504.04869OpenAlexW2982213128WikidataQ127003320 ScholiaQ127003320MaRDI QIDQ2042627
Rita E. Zuazua, Hanna Furmańczyk
Publication date: 21 July 2021
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.04869
Related Items (4)
Total colorings-a survey ⋮ Total equitable list coloring ⋮ On list equitable total colorings of the generalized theta graph ⋮ On the mutual visibility in Cartesian products and triangle-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the equitable total chromatic number of cubic graphs
- Determining the total colouring number is NP-hard
- Equitable total coloring of \(C_m\square C_n\)
- Equitable coloring and the maximum degree
- Equitable total coloring of graphs with maximum degree 3
- Equitable total-coloring of subcubic graphs
- On the corona of two graphs
- Equitable coloring of corona products of cubic graphs is harder than ordinary coloring
- Equitable Coloring
- On Representatives of Subsets
- The Colour Numbers of Complete Graphs
- On Total Chromatic Number of a Graph
This page was built for publication: Equitable total coloring of corona of cubic graphs