Complete forcing numbers of primitive coronoids

DOI10.1007/s10878-015-9881-yzbMath1354.90119OpenAlexW2051298618MaRDI QIDQ328729

Xiu-Song Liu, Shou-Jun Xu, Wai Hong Chan, Heping Zhang

Publication date: 20 October 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9881-y

zbMATH Keywords

perfect matchingKekulé structurecomplete forcing numbercomplete forcing setforcing setglobal forcing setprimitive coronoid

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (5)

Complete forcing numbers of hexagonal systems. II ⋮ Complete forcing numbers of complete and almost-complete multipartite graphs ⋮ Hexagonal systems with the one-to-one correspondence between geometric and algebraic Kekulé structures ⋮ Complete forcing numbers of hexagonal systems ⋮ Complete forcing numbers of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds on the forcing numbers of bipartite graphs
• Forcing matching numbers of fullerene graphs
• Matching theory
• The minimum forcing number for the torus and hypercube
• Defining sets in vertex colorings of graphs and latin rectangles
• Forcing numbers of stop signs.
• Plane elementary bipartite graphs
• Forcing matchings on square grids
• On the forced matching numbers of bipartite graphs
• Complete forcing numbers of catacondensed hexagonal systems
• On the minimum number of blocks defining a design
• On the spectrum of the forced matching number of graphs

This page was built for publication: Complete forcing numbers of primitive coronoids