Pages that link to "Item:Q3539931"
From MaRDI portal
The following pages link to List-coloring the square of a subcubic graph (Q3539931):
Displaying 29 items.
- \(S\)-packing colorings of cubic graphs (Q294536) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Injective colorings of graphs with low average degree (Q548659) (← links)
- The distance coloring of graphs (Q741239) (← links)
- Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) (Q741736) (← links)
- The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes (Q765320) (← links)
- Choosability of the square of planar subcubic graphs with large girth (Q1025548) (← links)
- Dynamic coloring parameters for graphs with given genus (Q1682887) (← links)
- List 3-dynamic coloring of graphs with small maximum average degree (Q1709543) (← links)
- List \(r\)-dynamic coloring of graphs with small maximum average degree (Q1732119) (← links)
- Decomposition of cubic graphs related to Wegner's conjecture (Q1732787) (← links)
- An optimal square coloring of planar graphs (Q1928491) (← links)
- 2-distance list \((\varDelta +3)\)-coloring of sparse graphs (Q2084788) (← links)
- Sharp upper bound of injective coloring of planar graphs with girth at least 5 (Q2165276) (← links)
- 2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10 (Q2165285) (← links)
- On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\) (Q2170502) (← links)
- Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
- Connectivity of minimum non-5-injectively colorable planar cubic graphs (Q2176826) (← links)
- A survey on packing colorings (Q2194523) (← links)
- \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) (Q2225423) (← links)
- List \(r\)-dynamic coloring of sparse graphs (Q2309401) (← links)
- Complexity of finding graph roots with girth conditions (Q2428666) (← links)
- Linear colorings of subcubic graphs (Q2444734) (← links)
- Brooks' theorem on powers of graphs (Q2449134) (← links)
- Painting squares in \(\Delta^2-1\) shades (Q2629492) (← links)
- List‐Coloring the Squares of Planar Graphs without 4‐Cycles and 5‐Cycles (Q4978441) (← links)
- (Q5883637) (← links)
- A note on 3-distance coloring of planar graphs (Q6563283) (← links)
- 2-distance \((\Delta + 1)\)-coloring of sparse graphs using the potential method (Q6635121) (← links)
