On L(2,1)-coloring split, chordal bipartite, and weakly chordal graphs
From MaRDI portal
Publication:1759841
Recommendations
Cites work
- Algorithmic graph theory and perfect graphs
- Approximations for -Colorings of Graphs
- Coloring Powers of Chordal Graphs
- Labeling bipartite permutation graphs with a condition at distance two
- Labelling Graphs with a Condition at Distance 2
- On the span in channel assignment problems: Bounds, computing and counting
Cited in
(11)- On L2-Golourings of a Graph
- On \(L(2,1)\)-coloring split permutation graphs
- \(L(2,1)\)-labeling of interval graphs
- On star and biclique edge-colorings
- Sum coloring on certain classes of graphs
- Approximations for -Colorings of Graphs
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
- On \(\lambda \)-coloring split, chordal bipartite and weakly chordal graphs
- Distance edge coloring and collision-free communication in wireless sensor networks
- \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
- On the universality and extremality of graphs with a distance constrained colouring
This page was built for publication: On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1759841)