Equitable total coloring of graphs with maximum degree 3
From MaRDI portal
Publication:1865129
DOI10.1007/S003730200051zbMATH Open1009.05060OpenAlexW2047826478MaRDI QIDQ1865129FDOQ1865129
Authors: Weifan Wang 
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
Recommendations
Cited In (17)
- On total coloring and equitable total coloring of infinite snark families
- Equitable total coloring of Fibonacci graphs
- The equitable total chromatic number of the graph \(\mathrm{HM}(W_n)\)
- Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring
- Equitable total chromatic number of \(K_{r \times p}\) for \(p\) even
- On the equitable total chromatic number of cubic graphs
- Total equitable list coloring
- Equitable total coloring of complete $r$-partite $p$-balanced graphs
- An algorithmic approach to equitable total chromatic number of graphs
- Equitable total coloring of corona of cubic graphs
- Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs
- Equitable coloring and equitable choosability of graphs with small maximum average degree
- On list equitable total colorings of the generalized theta graph
- Equitable total coloring of \(C_m\square C_n\)
- A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\)
- Equitable total-coloring of subcubic graphs
- Equitable total chromatic number of splitting graph
This page was built for publication: Equitable total coloring of graphs with maximum degree 3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865129)
