On λ-coloring split, chordal bipartite and weakly chordal graphs

DOI10.1016/j.endm.2009.11.049zbMath1268.05068OpenAlexW2028736963MaRDI QIDQ2840553

Daniel F. D. Posner, Márcia R. Cerioli

Publication date: 19 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.049

zbMATH Keywords

graph theory\(L(2, 1)\)-coloringweakly chordal graphs\(\lambda\)-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• On the span in channel assignment problems: Bounds, computing and counting
• Algorithmic graph theory and perfect graphs
• Labelling Graphs with a Condition at Distance 2
• Approximations for  -Colorings of Graphs
• Coloring Powers of Chordal Graphs