Coloring squares of graphs via vertex orderings
From MaRDI portal
Publication:5859506
DOI10.1142/S1793830920500937zbMath1458.05059OpenAlexW3042615408MaRDI QIDQ5859506
Publication date: 16 April 2021
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830920500937
Cites Work
- \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- Coloring the square of a \(K_{4}\)-minor free graph
- The square of a planar cubic graph is 7-colorable
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
- Bounding the chromatic number of squares of \(K_4\)-minor-free graphs
- Domination on Cocomparability Graphs
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
