Pages that link to "Item:Q298960"
From MaRDI portal
The following pages link to On the equitable total chromatic number of cubic graphs (Q298960):
Displaying 11 items.
- Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs (Q1701101) (← links)
- Equitable total coloring of corona of cubic graphs (Q2042627) (← 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)
- Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs (Q2663994) (← links)
- Total coloring and total matching: polyhedra and facets (Q2673562) (← links)
- Equitable coloring of corona products of cubic graphs is harder than ordinary coloring (Q2827784) (← links)
- Equitable total chromatic number of splitting graph (Q5142098) (← links)
- Kempe equivalence of colourings of cubic graphs (Q5965525) (← links)
- On total coloring and equitable total coloring of infinite snark families (Q6140969) (← links)
