The following pages link to Coloring Powers of Chordal Graphs (Q5317560):
Displaying 18 items.
- Distance constrained labelings of planar graphs with no short cycles (Q967308) (← links)
- Graph labellings with variable weights, a survey (Q967309) (← links)
- On colorings of graph fractional powers (Q968432) (← links)
- The \(L(h,1,1)\)-labelling problem for trees (Q976152) (← links)
- Distance constrained labelings of \(K_{4}\)-minor free graphs (Q1045067) (← links)
- On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs (Q1759841) (← links)
- New results in \(t\)-tone coloring of graphs (Q1953497) (← links)
- On coloring numbers of graph powers (Q2174571) (← links)
- Colouring exact distance graphs of chordal graphs (Q2305897) (← links)
- \(L(p,q)\) labeling of \(d\)-dimensional grids (Q2370453) (← links)
- Computing square roots of trivially perfect and threshold graphs (Q2446337) (← links)
- Labeling planar graphs with a condition at distance two (Q2461777) (← links)
- On the \(L(p,1)\)-labelling of graphs (Q2476282) (← links)
- On λ-coloring split, chordal bipartite and weakly chordal graphs (Q2840553) (← links)
- Distance Constrained Labelings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-minor Free Graphs (Q3439631) (← links)
- On the connectivity of k-distance graphs (Q5006605) (← links)
- On Injective Colourings of Chordal Graphs (Q5458556) (← links)
- On some parameters related to matching of graph powers (Q5865708) (← links)
