On graphs without a \(C_{4}\) or a diamond (Q531598): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5880194 / rank
 
Normal rank
Property / zbMATH Keywords
 
\(C_{4}\)-free graphs
Property / zbMATH Keywords: \(C_{4}\)-free graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
diamond-free graphs
Property / zbMATH Keywords: diamond-free graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
recognition algorithm
Property / zbMATH Keywords: recognition algorithm / rank
 
Normal rank

Revision as of 07:58, 1 July 2023

scientific article
Language Label Description Also known as
English
On graphs without a \(C_{4}\) or a diamond
scientific article

    Statements

    On graphs without a \(C_{4}\) or a diamond (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 April 2011
    0 references
    \(C_{4}\)-free graphs
    0 references
    diamond-free graphs
    0 references
    recognition algorithm
    0 references

    Identifiers