Complete forcing numbers of primitive coronoids

DOI10.1007/S10878-015-9881-YMaRDI QIDQ328729zbMATH OpenOpenAlexFDO

Authors S. J. Xu, Xiu-Song Liu, W. H. 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 matchingcomplete forcing numbercomplete forcing setforcing setglobal forcing setprimitive coronoidKekulé structure

Mathematics Subject Classification ID

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

Recommendations

• Complete forcing numbers of catacondensed hexagonal systems
• scientific article; zbMATH DE number 6749543
• Complete forcing numbers of hexagonal systems
• Complete forcing numbers of hexagonal systems. II
• Global forcing number of benzenoid graphs

Cites work

• scientific article; zbMATH DE number 1518742 (Why is no real title available?)
• scientific article; zbMATH DE number 2152546 (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?)
• scientific article; zbMATH DE number 4189780 (Why is no real title available?)
• Bounds on the forcing numbers of bipartite graphs
• Complete forcing numbers of catacondensed hexagonal systems
• Defining sets in vertex colorings of graphs and latin rectangles
• Forcing matching numbers of fullerene graphs
• Forcing matchings on square grids
• Forcing numbers of stop signs.
• Matching theory
• On the forced matching numbers of bipartite graphs
• On the minimum number of blocks defining a design
• On the spectrum of the forced matching number of graphs
• Plane elementary bipartite graphs
• The minimum forcing number for the torus and hypercube

Cited in

(7)

• Complete forcing numbers of complete and almost-complete multipartite graphs
• Complete forcing numbers of \((4, 6)\)-fullerenes
• Complete forcing numbers of graphs
• Complete forcing numbers of catacondensed hexagonal systems
• Complete forcing numbers of hexagonal systems
• Complete forcing numbers of hexagonal systems. II
• Hexagonal systems with the one-to-one correspondence between geometric and algebraic Kekulé structures

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

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