Coloring Powers of Chordal Graphs
From MaRDI portal
Recommendations
- On powers of chordal graphs and their colorings
- scientific article; zbMATH DE number 52166
- On colorings of graph powers
- The Chromatic Number of Graph Powers
- Chromatic-choosability of the power of graphs
- On coloring numbers of graph powers
- Chromaticity of chordal graphs
- scientific article; zbMATH DE number 742642
- Publication:4952682
- Coloring Powers of Planar Graphs
Cited in
(22)- Distance constrained labelings of \(K_{4}\)-minor free graphs
- On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs
- New results in \(t\)-tone coloring of graphs
- On coloring numbers of graph powers
- Colouring exact distance graphs of chordal graphs
- L(p,q) labeling of d-dimensional grids
- Computing square roots of trivially perfect and threshold graphs
- Labeling planar graphs with a condition at distance two
- On the \(L(p,1)\)-labelling of graphs
- On powers of chordal graphs and their colorings
- On \(\lambda \)-coloring split, chordal bipartite and weakly chordal graphs
- 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
- On the connectivity of k-distance graphs
- On Injective Colourings of Chordal Graphs
- On some parameters related to matching of graph powers
- Algebraic bounds for the independence and chromatic number of graph powers
- Ld(2,1)-labeling on T-graphs
- On the anti-forcing number of graph powers
- Distance constrained labelings of planar graphs with no short cycles
- Graph labellings with variable weights, a survey
- On colorings of graph fractional powers
- The \(L(h,1,1)\)-labelling problem for trees
This page was built for publication: Coloring Powers of Chordal Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317560)
