A note on Reed's conjecture for triangle-free graphs (Q6080563): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q122945353, #quickstatements; #temporary_batch_1718107089858
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an upper bound of the graph's chromatic number, depending on the graph's degree and density / rank
 
Normal rank
Property / cites work
 
Property / cites work: A compilation of relations between graph invariants—supplement I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The smallest triangle-free 4-chromatic 4-regular graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Probability. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the smallest $k$-chromatic graphs of given girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3872499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal triangle‐free 6‐chromatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound on the independence number of a graph and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small graphs with chromatic number 5: A computer search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4168627 / 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: Covering the vertex set of a graph with subgraphs of smaller degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest Graphs of Diameter 2 and Maximum Degree 6 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note On Reed's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic number of \(P_5\)-free graphs: Reed's conjecture / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:25, 3 August 2024

scientific article; zbMATH DE number 7745171
Language Label Description Also known as
English
A note on Reed's conjecture for triangle-free graphs
scientific article; zbMATH DE number 7745171

    Statements

    A note on Reed's conjecture for triangle-free graphs (English)
    0 references
    0 references
    0 references
    4 October 2023
    0 references
    Reed's conjecture
    0 references
    graph coloring
    0 references
    chromatic number
    0 references
    triangle-free graphs
    0 references
    girth
    0 references

    Identifiers