Pages that link to "Item:Q2439826"
From MaRDI portal
The following pages link to A unified approach to distance-two colouring of graphs on surfaces (Q2439826):
Displaying 23 items.
- Third case of the cyclic coloring conjecture (Q322178) (← links)
- Frugal, acyclic and star colourings of graphs (Q643020) (← links)
- Coloring non-crossing strings (Q727171) (← links)
- List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles (Q1631690) (← links)
- Chromatic numbers of exact distance graphs (Q1633747) (← links)
- Coloring squares of graphs with mad constraints (Q2009007) (← links)
- Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
- On the cyclic coloring conjecture (Q2214053) (← links)
- A survey on the cyclic coloring and its relaxations (Q2214302) (← links)
- Distance-two coloring of sparse graphs (Q2441647) (← links)
- Degeneracy and colorings of squares of planar graphs without 4-cycles (Q2658379) (← links)
- Cyclic coloring of plane graphs with maximum face size 16 and 17 (Q2662786) (← links)
- Improved square coloring of planar graphs (Q2685324) (← links)
- Third Case of the Cyclic Coloring Conjecture (Q2797092) (← links)
- Coloring a set of touching strings (Q2851465) (← links)
- Coloring Jordan Regions and Curves (Q5348217) (← links)
- Coloring the square of maximal Planar graphs with diameter two (Q6048644) (← links)
- Square Coloring Planar Graphs with Automatic Discharging (Q6141869) (← links)
- Edge-colouring graphs with local list sizes (Q6187343) (← links)
- A note on 3-distance coloring of planar graphs (Q6563283) (← links)
- Bounding clique size in squares of planar graphs (Q6568835) (← links)
- Cliques in squares of graphs with maximum average degree less than 4 (Q6642507) (← links)
- Counting circuit double covers (Q6657602) (← links)
