Improved lower bounds on the number of edges in list critical and online list critical graphs (Q2284728): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Colorings and orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the colouring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5732334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brooks' theorem via the Alon-Tarsi theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore-type versions of Brooks' theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with chromatic number close to maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound on the number of edges in colour-critical graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore's conjecture for \(k=4\) and Grötzsch's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore's conjecture on color-critical graphs is almost true / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimal number of edges in color-critical graphs / 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: Critically paintable, choosable or colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mr. Paint and Mrs. Correct / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line list colouring of graphs / rank
 
Normal rank

Revision as of 10:39, 21 July 2024

scientific article
Language Label Description Also known as
English
Improved lower bounds on the number of edges in list critical and online list critical graphs
scientific article

    Statements

    Improved lower bounds on the number of edges in list critical and online list critical graphs (English)
    0 references
    0 references
    0 references
    15 January 2020
    0 references
    critical graph
    0 references
    list coloring
    0 references
    online list coloring
    0 references

    Identifiers