Subcubic triangle-free graphs have fractional chromatic number at most 14/5 (Q5494396): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3098651475 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1301.5296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the independence number of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. I: Discharging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Planar Map is Four Colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3872499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fractional chromatic number of triangle-free subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fractional Chromatic Number of Graphs of Maximum Degree at Most Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the independence ratio of triangle-free cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in triangle-free cubic planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A (<5)-Colour Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence in graphs with maximum degree four / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size and independence in triangle‐free graphs with maximum degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fractional chromatic number of mycielski's graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fractional chromatic number of triangle-free graphs with \(\varDelta \leq 3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The four-colour theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Ramsey-Type Numbers and the Independence Ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite subgraphs of triangle-free subcubic graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:04, 8 July 2024

scientific article; zbMATH DE number 6322155
Language Label Description Also known as
English
Subcubic triangle-free graphs have fractional chromatic number at most 14/5
scientific article; zbMATH DE number 6322155

    Statements

    Subcubic triangle-free graphs have fractional chromatic number at most 14/5 (English)
    0 references
    0 references
    0 references
    0 references
    28 July 2014
    0 references
    Erdős-Vizing conjecture
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references