Graphs with chromatic number close to maximum degree (Q409481): 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: Alexandr V. Kostochka / rank
Normal rank
 
Property / author
 
Property / author: Q178710 / rank
Normal rank
 
Property / author
 
Property / author: Alexandr V. Kostochka / 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.1016/j.disc.2011.12.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032656190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another bound on the chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the colouring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of k-chromatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5732334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore-type versions of Brooks' theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3656238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Delta \)-critical graphs with small high vertex cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs / rank
 
Normal rank

Latest revision as of 01:23, 5 July 2024

scientific article
Language Label Description Also known as
English
Graphs with chromatic number close to maximum degree
scientific article

    Statements

    Graphs with chromatic number close to maximum degree (English)
    0 references
    0 references
    0 references
    0 references
    13 April 2012
    0 references
    graph coloring
    0 references
    Brooks' theorem
    0 references
    critical graphs
    0 references

    Identifiers