Some tight bounds on the minimum and maximum forcing numbers of graphs (Q2097177): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 2106.09209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unimodularity of the Clar number problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the forced matching numbers of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectrum of the forced matching number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some graphs with a unique perfect matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4903414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal anti-forcing numbers of perfect matchings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum forcing number of perfect matchings in the hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the forcing numbers of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-forcing numbers of perfect matchings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4595660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of factorizable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal elementary bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing matchings on square grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum forcing number for the torus and hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight upper bound on the maximum anti-forcing numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the anti-forcing number of benzenoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The forcing number of toroidal polyhexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5408293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5165190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A maximum resonant set of polyomino graphs / rank
 
Normal rank

Latest revision as of 20:04, 30 July 2024

scientific article
Language Label Description Also known as
English
Some tight bounds on the minimum and maximum forcing numbers of graphs
scientific article

    Statements

    Some tight bounds on the minimum and maximum forcing numbers of graphs (English)
    0 references
    0 references
    0 references
    11 November 2022
    0 references
    perfect matching
    0 references
    minimum forcing number
    0 references
    maximum forcing number
    0 references
    bipartite graph
    0 references

    Identifiers