Pages that link to "Item:Q1865129"
From MaRDI portal
The following pages link to Equitable total coloring of graphs with maximum degree 3 (Q1865129):
Displaying 17 items.
- On the equitable total chromatic number of cubic graphs (Q298960) (← links)
- Equitable total coloring of \(C_m\square C_n\) (Q1028450) (← links)
- Equitable coloring and equitable choosability of graphs with small maximum average degree (Q1649917) (← links)
- A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) (Q1686044) (← links)
- Total equitable list coloring (Q1756126) (← links)
- Equitable total coloring of corona of cubic graphs (Q2042627) (← links)
- On list equitable total colorings of the generalized theta graph (Q2042636) (← links)
- Equitable total chromatic number of \(K_{r \times p}\) for \(p\) even (Q2132407) (← links)
- Equitable total-coloring of subcubic graphs (Q2341763) (← links)
- Equitable total coloring of complete $r$-partite $p$-balanced graphs (Q2414460) (← links)
- The equitable total chromatic number of the graph \(\mathrm{HM}(W_n)\) (Q2454985) (← links)
- Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs (Q2663994) (← links)
- Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring (Q2911051) (← links)
- An Algorithmic Approach to Equitable Total Chromatic Number of Graphs (Q4634467) (← links)
- Equitable total chromatic number of splitting graph (Q5142098) (← links)
- On total coloring and equitable total coloring of infinite snark families (Q6140969) (← links)
- Equitable total coloring of Fibonacci graphs (Q6583579) (← links)
