Complete forcing numbers of graphs

DOI10.26493/1855-3974.2706.3C8MaRDI QIDQ5871599zbMATH OpenOpenAlexFDO

Authors

Publication date 23 January 2023

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.26493/1855-3974.2706.3c8

zbMATH Keywords

cylinderperfect matchingwheelcomplete forcing numbercyclomatic numberglobal forcing number

Mathematics Subject Classification ID

Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• Complete forcing numbers of catacondensed hexagonal systems
• Complete Forcing Numbers of Polyphenyl Systems
• Complete forcing numbers of hexagonal systems
• Complete forcing numbers of primitive coronoids
• scientific article; zbMATH DE number 6749543

Cites work

• scientific article; zbMATH DE number 2152546 (Why is no real title available?)
• scientific article; zbMATH DE number 6127683 (Why is no real title available?)
• scientific article; zbMATH DE number 6749543 (Why is no real title available?)
• scientific article; zbMATH DE number 5238980 (Why is no real title available?)
• A min-max theorem for plane bipartite graphs
• Anti-forcing numbers of perfect matchings of graphs
• Complete Forcing Numbers of Polyphenyl Systems
• Complete forcing numbers of catacondensed hexagonal systems
• Complete forcing numbers of hexagonal systems
• Complete forcing numbers of hexagonal systems. II
• Complete forcing numbers of primitive coronoids
• Global forcing number of benzenoid graphs
• Global forcing number of some chemical graphs
• Graph theory with applications
• Matching theory
• On n-extendable graphs
• On the global forcing number of hexagonal systems
• Perfect matchings in hexagonal systems
• Perfect matchings in hexagonal systems
• Pick's Theorem
• Plane elementary bipartite graphs
• The global forcing number of the parallelogram polyhex
• When each hexagon of a hexagonal system covers it
• \(k\)-cycle resonant graphs

Cited in

(8)

• scientific article; zbMATH DE number 7528059 (Why is no real title available?)
• Forcing matching numbers of fullerene graphs
• Complete forcing numbers of complete and almost-complete multipartite graphs
• Complete forcing numbers of \((4, 6)\)-fullerenes
• scientific article; zbMATH DE number 5238980 (Why is no real title available?)
• Finitely forcible graphons and permutons
• Global forcing number for maximal matchings in corona products
• Finitely forcible graphons

This page was built for publication: Complete forcing numbers of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5871599)