Equitable total coloring of graphs with maximum degree 3
From MaRDI portal
(Redirected from Publication:1865129)
Recommendations
Cited in
(17)- Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs
- Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring
- On list equitable total colorings of the generalized theta graph
- Equitable total coloring of complete $r$-partite $p$-balanced graphs
- Equitable total-coloring of subcubic graphs
- 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 Fibonacci graphs
- On total coloring and equitable total coloring of infinite snark families
- Equitable coloring and equitable choosability of graphs with small maximum average degree
- Equitable total chromatic number of splitting graph
- Equitable total coloring of \(C_m\square C_n\)
- Total equitable list coloring
- Equitable total chromatic number of \(K_{r \times p}\) for \(p\) even
- Equitable total coloring of corona of cubic graphs
- The equitable total chromatic number of the graph \(\mathrm{HM}(W_n)\)
- An algorithmic approach to equitable total chromatic number of graphs
- On the equitable total chromatic number of cubic graphs
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)
