\(k\)-forested coloring of planar graphs with large girth (Q632996): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-distance coloring of sparse planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic Colourings of Planar Graphs with Large Girth / 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: Estimation of sparse hessian matrices and graph coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear choosability 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: Colouring a graph frugally / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Coloring With $\Delta + \mbox\lowercasepoly(\log \Delta)$ Colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear coloring of planar graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear coloring of graphs / rank
 
Normal rank

Latest revision as of 21:39, 3 July 2024

scientific article
Language Label Description Also known as
English
\(k\)-forested coloring of planar graphs with large girth
scientific article

    Statements

    Identifiers