Pages that link to "Item:Q2930038"
From MaRDI portal
The following pages link to 2-Distance Coloring of Sparse Graphs (Q2930038):
Displaying 28 items.
- Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors (Q317434) (← links)
- On 1-improper 2-coloring of sparse graphs (Q393935) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- List coloring the square of sparse graphs with large degree (Q740267) (← links)
- The list 2-distance coloring of sparse graphs (Q776639) (← links)
- Coloring the square of graphs whose maximum average degree is less than 4 (Q906469) (← links)
- Facial incidence colorings of embedded multigraphs (Q1630925) (← links)
- List \(r\)-hued chromatic number of graphs with bounded maximum average degrees (Q1709519) (← links)
- 2-distance colorings of integer distance graphs (Q1717215) (← links)
- List \(r\)-dynamic coloring of graphs with small maximum average degree (Q1732119) (← links)
- 2-distance list \((\varDelta +3)\)-coloring of sparse graphs (Q2084788) (← links)
- A characterization of graphs with regular distance-2 graphs (Q2097182) (← links)
- List 2-distance coloring of planar graphs with girth five (Q2155644) (← links)
- 2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10 (Q2165285) (← links)
- Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
- \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) (Q2225423) (← links)
- Incidence coloring -- cold cases (Q2282487) (← links)
- The \(k\)-distance chromatic number of trees and cycles (Q2293844) (← links)
- Incidence coloring of graphs with high maximum average degree (Q2357131) (← links)
- Distance-two coloring of sparse graphs (Q2441647) (← links)
- Hypergraph incidence coloring (Q2689485) (← links)
- 2-distance coloring of sparse graphs (Q2857337) (← links)
- List 2-distance coloring of graphs with maximum degree 5 (Q4690453) (← links)
- (Q4865135) (← links)
- Distance-2 Coloring in the CONGEST Model (Q5855241) (← links)
- Finding cut-vertices in the square roots of a graph (Q5915963) (← links)
- Incidence coloring of outer-1-planar graphs (Q6565538) (← links)
- 2-distance \((\Delta + 1)\)-coloring of sparse graphs using the potential method (Q6635121) (← links)
