Pages that link to "Item:Q1025548"
From MaRDI portal
The following pages link to Choosability of the square of planar subcubic graphs with large girth (Q1025548):
Displaying 15 items.
- \(S\)-packing colorings of cubic graphs (Q294536) (← links)
- List 2-facial 5-colorability of plane graphs with girth at least 12 (Q658054) (← links)
- Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) (Q741736) (← links)
- The \(L(p, q)\)-labelling of planar graphs without 4-cycles (Q741764) (← links)
- The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes (Q765320) (← links)
- List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles (Q1631690) (← links)
- On list \(r\)-hued coloring of planar graphs (Q1680495) (← links)
- List 3-dynamic coloring of graphs with small maximum average degree (Q1709543) (← links)
- Distance-two colourings of Barnette graphs (Q2225415) (← links)
- \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree (Q2370454) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- Complexity of finding graph roots with girth conditions (Q2428666) (← links)
- Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable (Q2636827) (← links)
- Exact square coloring of subcubic planar graphs (Q2659166) (← links)
- 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4 (Q6041534) (← links)
