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):
Displayed 50 items.
- An improved bound on 2-distance coloring plane graphs with girth 5 (Q306114) (← links)
- Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors (Q317434) (← links)
- 2-distance coloring of a planar graph without 3, 4, 7-cycles (Q328716) (← links)
- Locally injective \(k\)-colourings of planar graphs (Q400498) (← links)
- \(L(p,q)\)-labeling of a graph embeddable on the torus (Q400502) (← links)
- On backbone coloring of graphs (Q434190) (← links)
- Coloring the square of Sierpiński graphs (Q497382) (← links)
- \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle (Q498455) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- On 2-distance coloring of plane graphs with girth 5 (Q516880) (← links)
- Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6 (Q536624) (← links)
- Injective colorings of graphs with low average degree (Q548659) (← links)
- List injective colorings of planar graphs (Q615993) (← links)
- On distance constrained labeling of disk graphs (Q703553) (← links)
- Coloring the square of the Cartesian product of two cycles (Q708380) (← links)
- Minimum 2-distance coloring of planar graphs and channel assignment (Q724734) (← links)
- List injective coloring of planar graphs with girth \(g \geq 6\) (Q738861) (← links)
- The distance coloring of graphs (Q741239) (← 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)
- \(L(p, q)\)-labeling of planar graphs with small girth (Q777443) (← links)
- List version of \(L(d,s)\)-labelings (Q817777) (← links)
- \(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs (Q844189) (← links)
- A note on 2-facial coloring of plane graphs (Q844207) (← links)
- The 2-dipath chromatic number of Halin graphs (Q845671) (← links)
- The \(L(2,1)\)-labeling on planar graphs (Q868019) (← links)
- Linear choosability of graphs (Q932648) (← links)
- Labelling planar graphs without 4-cycles with a condition on distance two (Q947103) (← links)
- \([r,s,t]\)-coloring of trees and bipartite graphs (Q960923) (← links)
- The distant-2 chromatic number of random proximity and random geometric graphs (Q963353) (← links)
- Distance constrained labelings of planar graphs with no short cycles (Q967308) (← links)
- Graph labellings with variable weights, a survey (Q967309) (← links)
- \(L(j,k)\)-labelling and maximum ordering-degrees for trees (Q968198) (← links)
- (2,1)-total labelling of trees with sparse vertices of maximum degree (Q976073) (← links)
- \((2,1)\)-Total number of trees with maximum degree three (Q989489) (← links)
- List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six (Q1024323) (← links)
- Some results on distance two labelling of outerplanar graphs (Q1036889) (← links)
- \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings (Q1045046) (← links)
- Injective colorings of planar graphs with few colors (Q1045050) (← links)
- Distance constrained labelings of \(K_{4}\)-minor free graphs (Q1045067) (← links)
- 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\) (Q1045187) (← links)
- Coloring the square of a \(K_{4}\)-minor free graph (Q1402088) (← links)
- Optimal channel assignment and \(L(p,1)\)-labeling (Q1630278) (← links)
- List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles (Q1631690) (← links)
- The List \(L(2, 1)\)-labeling of planar graphs (Q1637136) (← links)
- Injective coloring of some graph operations (Q1659655) (← links)
- Facial \(L(2, 1)\)-edge-labelings of trees (Q1671360) (← links)
- 2-distance coloring of planar graphs with girth 5 (Q1679523) (← links)
- On list \(r\)-hued coloring of planar graphs (Q1680495) (← links)