Pages that link to "Item:Q2485944"
From MaRDI portal
The following pages link to A bound on the chromatic number of the square of a planar graph (Q2485944):
Displaying 17 items.
- Injective coloring of planar graphs (Q5902135) (← links)
- Finding cut-vertices in the square roots of a graph (Q5915963) (← links)
- A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable (Q5963659) (← links)
- Coloring the square of maximal Planar graphs with diameter two (Q6048644) (← links)
- L(2,1,1)-labeling of interval graphs (Q6107729) (← links)
- 2-distance coloring of planar graphs without adjacent 5-cycles (Q6166190) (← links)
- 2-Distance coloring of planar graphs without triangles and intersecting 4-cycles (Q6174168) (← links)
- The list \(r\)-hued coloring of \(K_{m, n}\) (Q6204299) (← links)
- A note on 3-distance coloring of planar graphs (Q6563283) (← links)
- Bounding clique size in squares of planar graphs (Q6568835) (← links)
- Some results on 2-distance coloring of planar graphs with girth five (Q6571280) (← links)
- Minimization of span in \(L(3,1)\)-labeling for a particular type of intersection graphs (Q6608601) (← links)
- Relaxation of Wegner's planar graph conjecture for maximum degree 4 (Q6611072) (← links)
- Improved 2-distance coloring of planar graphs with maximum degree 5 (Q6635091) (← links)
- The 2-distance chromatic number of planar graphs without 3,4,8-cycles (Q6645214) (← links)
- An improved bound for 2-distance coloring of planar graphs with girth six (Q6657227) (← links)
- Counting circuit double covers (Q6657602) (← links)
