A Brooks-type bound for squares of \(K_{4}\)-minor-free graphs (Q1045198): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2009.07.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081421959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Colouring Squares of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List-colouring the square of a \(K_4\)-minor-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosability conjectures and multicircuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the square of a \(K_{4}\)-minor free graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:57, 2 July 2024

scientific article
Language Label Description Also known as
English
A Brooks-type bound for squares of \(K_{4}\)-minor-free graphs
scientific article

    Statements

    A Brooks-type bound for squares of \(K_{4}\)-minor-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    0 references
    chromatic number
    0 references
    vertex coloring
    0 references
    Brooks-type bound
    0 references
    square of a graph
    0 references
    series-parallel graph
    0 references
    0 references