A short proof of Brooks’ Theorem for vertex arboricity (Q5154607): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.akcej.2019.03.005 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Brooks' Theorem and Beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores and shells of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three short proofs in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The point-arboricity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical Point-Arboritic Graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128181170 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AKCEJ.2019.03.005 / rank
 
Normal rank

Latest revision as of 16:09, 30 December 2024

scientific article; zbMATH DE number 7406375
Language Label Description Also known as
English
A short proof of Brooks’ Theorem for vertex arboricity
scientific article; zbMATH DE number 7406375

    Statements

    A short proof of Brooks’ Theorem for vertex arboricity (English)
    0 references
    0 references
    5 October 2021
    0 references
    Brooks' theorem
    0 references
    vertex arboricity
    0 references
    degeneracy
    0 references
    vertex coloring
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references