Pages that link to "Item:Q3614198"
From MaRDI portal
The following pages link to List-Coloring Squares of Sparse Subcubic Graphs (Q3614198):
Displaying 20 items.
- Locally injective \(k\)-colourings of planar graphs (Q400498) (← links)
- Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
- List 2-facial 5-colorability of plane graphs with girth at least 12 (Q658054) (← links)
- List coloring the square of sparse graphs with large degree (Q740267) (← 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)
- Are there any good digraph width measures? (Q896003) (← links)
- Choosability of the square of planar subcubic graphs with large girth (Q1025548) (← links)
- The square of a planar cubic graph is 7-colorable (Q1682215) (← links)
- The complexity of frugal colouring (Q2023759) (← links)
- Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
- A survey on the cyclic coloring and its relaxations (Q2214302) (← links)
- Distance-two colourings of Barnette graphs (Q2225415) (← links)
- List \((p,q)\)-coloring of sparse plane graphs (Q2371265) (← links)
- Linear colorings of subcubic graphs (Q2444734) (← links)
- Computing square roots of trivially perfect and threshold graphs (Q2446337) (← links)
- Exact square coloring of subcubic planar graphs (Q2659166) (← links)
- 2-distance coloring of sparse graphs (Q2857337) (← links)
- On the Complexity of Planar Covering of Small Graphs (Q3104767) (← links)
- List-coloring the square of a subcubic graph (Q3539931) (← links)
