Radius two trees specify χ‐bounded classes (Q4309985): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q200923 / rank
Normal rank
 
Property / author
 
Property / author: William T. jun. Trotter / rank
Normal rank
 
Property / author
 
Property / author: Henry A. Kierstead / rank
 
Normal rank
Property / author
 
Property / author: William T. jun. Trotter / rank
 
Normal rank
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.1002/jgt.3190180203 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094108224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic number of graphs and set-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Ramsey-type theorem for traceable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line and first fit colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subtrees in graphs of large chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249728 / rank
 
Normal rank

Latest revision as of 18:17, 22 May 2024

scientific article; zbMATH DE number 665810
Language Label Description Also known as
English
Radius two trees specify χ‐bounded classes
scientific article; zbMATH DE number 665810

    Statements

    Radius two trees specify χ‐bounded classes (English)
    0 references
    20 March 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    players
    0 references
    game
    0 references
    game chromatic number
    0 references
    winning strategy
    0 references
    planar graphs
    0 references
    outerplanar graph
    0 references
    lower bounds
    0 references
    0 references