Relations between global forcing number and maximum anti-forcing number of a graph (Q2078844): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Integer and Fractional Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2856681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint Odd Cycles in Cubic Solid Bricks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Birkhoff--von Neumann Graphs that are PM-Compact / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The perfect matching polytope and solid bricks / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to build a brick / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Little's theorem on Pfaffian orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-forcing spectra of perfect matchings of graphs / 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: Global forcing number of benzenoid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brick decompositions and the matching rank of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simpler proof for the two disjoint odd cycles theorem / 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: Hexagonal systems with forcing single edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching structure and the matching lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Two Unsolved Problems Concerning Matching Covered Graphs / 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: The global forcing number of the parallelogram polyhex / 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: Q5442366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4664109 / 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: On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5408293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the global forcing number of hexagonal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A maximum resonant set of polyomino graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5279137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimax result for perfect matchings of a polyomino graph / rank
 
Normal rank

Revision as of 04:18, 28 July 2024

scientific article
Language Label Description Also known as
English
Relations between global forcing number and maximum anti-forcing number of a graph
scientific article

    Statements

    Relations between global forcing number and maximum anti-forcing number of a graph (English)
    0 references
    0 references
    4 March 2022
    0 references
    perfect matching
    0 references
    perfect matching polytope
    0 references
    Birkhoff-von Neumann graph
    0 references
    solid brick
    0 references
    maximum anti-forcing number
    0 references
    global forcing number
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers