Equitable total coloring of graphs with maximum degree 3
From MaRDI portal
Publication:1865129
DOI10.1007/s003730200051zbMath1009.05060OpenAlexW2047826478MaRDI QIDQ1865129
Publication date: 25 March 2003
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730200051
Related Items (13)
Equitable total chromatic number of \(K_{r \times p}\) for \(p\) even ⋮ On the equitable total chromatic number of cubic graphs ⋮ Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs ⋮ Equitable total coloring of complete $r$-partite $p$-balanced graphs ⋮ On total coloring and equitable total coloring of infinite snark families ⋮ The equitable total chromatic number of the graph \(\mathrm{HM}(W_n)\) ⋮ Equitable total chromatic number of splitting graph ⋮ An Algorithmic Approach to Equitable Total Chromatic Number of Graphs ⋮ Total equitable list coloring ⋮ Equitable total coloring of corona of cubic graphs ⋮ On list equitable total colorings of the generalized theta graph ⋮ Equitable total coloring of \(C_m\square C_n\) ⋮ Equitable total-coloring of subcubic graphs
This page was built for publication: Equitable total coloring of graphs with maximum degree 3
