Steinberg-like theorems for backbone colouring (Q5916058): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2017.03.009 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Every Planar Map is Four Colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backbone colorings for graphs: Tree and path backbones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backbone colouring: tree backbones with small diameter in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steinberg's conjecture is false / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Circular) backbone colouring: forest backbones in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139765 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2017.03.009 / rank
 
Normal rank

Latest revision as of 08:17, 11 December 2024

scientific article; zbMATH DE number 6872418
Language Label Description Also known as
English
Steinberg-like theorems for backbone colouring
scientific article; zbMATH DE number 6872418

    Statements

    Steinberg-like theorems for backbone colouring (English)
    0 references
    24 May 2018
    0 references
    graph colouring
    0 references
    planar graph
    0 references
    backbone colouring
    0 references
    Steinberg's conjecture
    0 references

    Identifiers