Bipartite subgraphs of graphs with maximum degree three (Q1299990)

From MaRDI portal
Revision as of 20:06, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Bipartite subgraphs of graphs with maximum degree three
scientific article

    Statements

    title
    Bipartite subgraphs of graphs with maximum degree three (English)
    0 references
    author
    Stanisław Bylka
    0 references
    Adam Idzik
    0 references
    Jan Komar
    0 references
    publication date
    22 November 1999
    0 references
    zbMATH Keywords
    bicolouring
    0 references
    connected graph
    0 references
    maximum degree
    0 references
    bipartite subgraph
    0 references
    extremal graphs
    0 references

    Identifiers

    DOI
    10.1007/s003730050047
    0 references
    Mathematics Subject Classification ID
    05C35
    0 references
    05C75
    0 references
    05C15
    0 references
    zbMATH DE Number
    1332846
    0 references
    OpenAlex ID
    W2014378349
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1299990&oldid=31681796"
    Powered by MediaWiki