Coloring Powers of Chordal Graphs
From MaRDI portal
Publication:5317560
DOI10.1137/S0895480103424079zbMath1069.05035WikidataQ57601554 ScholiaQ57601554MaRDI QIDQ5317560
Publication date: 16 September 2005
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
\(L(p,q)\) labeling of \(d\)-dimensional grids ⋮ On coloring numbers of graph powers ⋮ New results in \(t\)-tone coloring of graphs ⋮ 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 \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs ⋮ 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 ⋮ On Injective Colourings of Chordal Graphs ⋮ Colouring exact distance graphs of chordal graphs ⋮ On λ-coloring split, chordal bipartite and weakly chordal graphs ⋮ Distance constrained labelings of \(K_{4}\)-minor free graphs ⋮ On the connectivity of k-distance graphs ⋮ On some parameters related to matching of graph powers ⋮ 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
