Complete forcing numbers of primitive coronoids
From MaRDI portal
Publication:328729
DOI10.1007/S10878-015-9881-YzbMATH Open1354.90119OpenAlexW2051298618MaRDI QIDQ328729FDOQ328729
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
Recommendations
perfect matchingcomplete forcing numbercomplete forcing setforcing setglobal forcing setprimitive coronoidKekulé structure
Cites Work
- Matching theory
- Title not available (Why is that?)
- Plane elementary bipartite graphs
- Forcing matchings on square grids
- The minimum forcing number for the torus and hypercube
- Forcing numbers of stop signs.
- On the forced matching numbers of bipartite graphs
- On the spectrum of the forced matching number of graphs
- Title not available (Why is that?)
- Forcing matching numbers of fullerene graphs
- Complete forcing numbers of catacondensed hexagonal systems
- Defining sets in vertex colorings of graphs and latin rectangles
- On the minimum number of blocks defining a design
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounds on the forcing numbers of bipartite graphs
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)
