Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs
From MaRDI portal
Publication:668443
DOI10.1016/j.amc.2015.09.084zbMath1410.05075OpenAlexW2199814049MaRDI QIDQ668443
Publication date: 19 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.09.084
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rainbow connection in 3-connected graphs
- The complexity of determining the rainbow vertex-connection of a graph
- Acyclic and star colorings of cographs
- Acyclic colorings of subcubic graphs
- Every planar graph has an acyclic 7-coloring
- Every planar graph has an acyclic 8-coloring
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs
- Rainbow connections of graphs: a survey
- Note on the hardness of rainbow connections for planar and line graphs
- Acyclic coloring of graphs of maximum degree five: nine colors are enough
- On acyclic colorings of planar graphs. (Reprint)
- On the rainbow vertex-connection
- Star coloring of graphs
- P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
- New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
- Estimation of sparse hessian matrices and graph coloring problems
- A Linear Recognition Algorithm for Cographs
- Acyclic coloring of graphs
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- Acyclic colorings of planar graphs