Complete forcing numbers of graphs

DOI10.26493/1855-3974.2706.3C8zbMATH Open1506.05172OpenAlexW4288714177MaRDI QIDQ5871599FDOQ5871599

Authors:

Publication date: 23 January 2023

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

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

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

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)

Cites Work

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

Cited In (8)

• Title not available (Why is that?)
• Forcing matching numbers of fullerene graphs
• Complete forcing numbers of complete and almost-complete multipartite graphs
• Complete forcing numbers of \((4, 6)\)-fullerenes
• Title not available (Why is that?)
• 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)