Complete forcing numbers of graphs

DOI10.26493/1855-3974.2706.3c8zbMath1506.05172OpenAlexW4288714177MaRDI QIDQ5871599

No author found.

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

zbMATH Keywords

cylinderwheelcyclomatic numberperfect matchingcomplete forcing 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)

Related Items (1)

Complete forcing numbers of complete and almost-complete multipartite graphs

Cites Work

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

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