Making a \(C_6\)-free graph \(C_4\)-free and bipartite (Q298970): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Q340519 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6595955 / rank
 
Normal rank
Property / zbMATH Keywords
 
extremal graphs
Property / zbMATH Keywords: extremal graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
bipartite subgraphs
Property / zbMATH Keywords: bipartite subgraphs / rank
 
Normal rank
Property / zbMATH Keywords
 
6-cycles
Property / zbMATH Keywords: 6-cycles / rank
 
Normal rank
Property / zbMATH Keywords
 
4-cycles
Property / zbMATH Keywords: 4-cycles / rank
 
Normal rank

Revision as of 21:29, 27 June 2023

scientific article
Language Label Description Also known as
English
Making a \(C_6\)-free graph \(C_4\)-free and bipartite
scientific article

    Statements

    Making a \(C_6\)-free graph \(C_4\)-free and bipartite (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 June 2016
    0 references
    extremal graphs
    0 references
    bipartite subgraphs
    0 references
    6-cycles
    0 references
    4-cycles
    0 references

    Identifiers