Complete forcing numbers of graphs (Q5871599): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A min-max theorem for plane bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2856681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5279140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4903414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global forcing number of benzenoid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pick's Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-cycle resonant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete forcing numbers of hexagonal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete forcing numbers of hexagonal systems. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-forcing numbers of perfect matchings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Forcing Numbers of Polyphenyl Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On n-extendable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in hexagonal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The global forcing number of the parallelogram polyhex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5442366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4664109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete forcing numbers of primitive coronoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete forcing numbers of catacondensed hexagonal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: When each hexagon of a hexagonal system covers it / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in hexagonal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the global forcing number of hexagonal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plane elementary bipartite graphs / rank
 
Normal rank

Revision as of 08:15, 31 July 2024

scientific article; zbMATH DE number 7644312
Language Label Description Also known as
English
Complete forcing numbers of graphs
scientific article; zbMATH DE number 7644312

    Statements

    Complete forcing numbers of graphs (English)
    0 references
    23 January 2023
    0 references
    perfect matching
    0 references
    global forcing number
    0 references
    complete forcing number
    0 references
    cyclomatic number
    0 references
    wheel
    0 references
    cylinder
    0 references

    Identifiers