Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs (Q668443): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2015.09.084 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2199814049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph has an acyclic 7-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of planar graphs. (Reprint) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of determining the rainbow vertex-connection of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of sparse hessian matrices and graph coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic coloring of graphs of maximum degree five: nine colors are enough / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Acyclic and Star Coloring Algorithms with Application to Computing Hessians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the hardness of rainbow connections for planar and line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time optimization algorithms for \(P_ 4\)-sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic and star colorings of cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the rainbow vertex-connection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connections of graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph has an acyclic 8-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5472076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of subcubic graphs / rank
 
Normal rank

Latest revision as of 19:48, 18 July 2024

scientific article
Language Label Description Also known as
English
Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs
scientific article

    Statements

    Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs (English)
    0 references
    0 references
    19 March 2019
    0 references
    vertex coloring
    0 references
    join
    0 references
    disjoint union
    0 references
    cographs
    0 references
    \(P_4\)-reducible graphs
    0 references
    \(P_4\)-spare graphs
    0 references

    Identifiers