On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs
From MaRDI portal
Publication:1759841
DOI10.1016/j.dam.2012.03.018zbMath1257.05039OpenAlexW2035458006MaRDI QIDQ1759841
Daniel F. D. Posner, Márcia R. Cerioli
Publication date: 22 November 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.018
Related Items (5)
Distance edge coloring and collision‐free communication in wireless sensor networks ⋮ On star and biclique edge-colorings ⋮ \(L(2,1)\)-labeling of interval graphs ⋮ \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs ⋮ \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
Cites Work
- Labeling bipartite permutation graphs with a condition at distance two
- 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
This page was built for publication: On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs
