The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges (Q2255804)

From MaRDI portal
Revision as of 17:36, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges
scientific article

    Statements

    The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges (English)
    0 references
    0 references
    0 references
    18 February 2015
    0 references
    bipartite graphs
    0 references
    Turán's theorem
    0 references
    omission of edges
    0 references
    critical graph
    0 references
    girth
    0 references
    transitive automorphism group
    0 references

    Identifiers