Some novel minimax results for perfect matchings of hexagonal systems (Q2166259): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
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: Q4903414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3816119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5454413 / 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: Packing directed circuits exactly / 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: 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: Perfect matchings in hexagonal systems / 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: Normal components, Kekulé patterns, and Clar patterns in plane bipartite 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: On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniquely forced perfect matching and unique 3-edge-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5408293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4903411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3710568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Z-transformation graphs of perfect matchings of hexagonal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hexagonal systems with forcing edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plane elementary bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between global forcing number and maximum anti-forcing number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A maximal cover of hexagonal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5279137 / rank
 
Normal rank

Latest revision as of 23:26, 29 July 2024

scientific article
Language Label Description Also known as
English
Some novel minimax results for perfect matchings of hexagonal systems
scientific article

    Statements

    Some novel minimax results for perfect matchings of hexagonal systems (English)
    0 references
    0 references
    0 references
    24 August 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    hexagonal system
    0 references
    perfect matching
    0 references
    anti-forcing number
    0 references
    fries number
    0 references
    triphenylene
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references