2-coloring number revisited (Q2333797): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Map-Coloring Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new game chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs have two-coloring number at most 8 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring and Covering Nowhere Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalised colouring numbers of graphs that exclude a fixed minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Graph Packing via Game Colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Coloring Number and Degenerate Colorings of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radius two trees specify χ‐bounded classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings on graphs and game coloring number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest-last ordering and clustering and graph coloring algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring graphs with bounded generalized colouring number / rank
 
Normal rank

Latest revision as of 23:13, 20 July 2024

scientific article
Language Label Description Also known as
English
2-coloring number revisited
scientific article

    Statements

    Identifiers