Acyclic and star coloring of P₄-reducible and P₄-sparse graphs

DOI10.1016/J.AMC.2015.09.084zbMATH Open1410.05075OpenAlexW2199814049MaRDI QIDQ668443FDOQ668443

Authors: Jun Yue 

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

Recommendations

• Coloring with no 2-colored \(P_4\)'s
• Restricted coloring problems on graphs with few \(P_4\)'s
• Acyclic and star colorings of cographs
• Restricted coloring problems on graphs with few \(P'_4s\)
• On the acyclic choosability of graphs

zbMATH Keywords

joincographsvertex coloringdisjoint union\(P_4\)-reducible graphs\(P_4\)-spare graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Graph theory
• Note on the hardness of rainbow connections for planar and line graphs
• Acyclic coloring of graphs of maximum degree five: nine colors are enough
• Acyclic colorings of planar graphs
• The complexity of determining the rainbow vertex-connection of a graph
• On the rainbow vertex-connection
• Rainbow connection in 3-connected graphs
• Acyclic coloring of graphs
• Star coloring of graphs
• New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
• Estimation of sparse hessian matrices and graph coloring problems
• Acyclic and star colorings of cographs
• A Linear Recognition Algorithm for Cographs
• The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
• Acyclic colorings of subcubic graphs
• Title not available (Why is that?)
• P₄-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
• Every planar graph has an acyclic 7-coloring
• Every planar graph has an acyclic 8-coloring
• On acyclic colorings of planar graphs. (Reprint)
• Title not available (Why is that?)
• Linear time optimization algorithms for \(P_ 4\)-sparse graphs

Cited In (6)

• On the double Roman domination of graphs
• The acircuitic directed star arboricity of subcubic graphs is at most four
• Acyclic and star colorings of cographs
• Note on the perfect Roman domination number of graphs
• Restricted coloring problems on graphs with few \(P_4\)'s
• Restricted coloring problems on graphs with few \(P'_4s\)

This page was built for publication: Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q668443)