Anti-forcing numbers of perfect matchings of graphs (Q5962519): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2015.08.024 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1488229411 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1406.3796 / 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: Q3206969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4903414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3813830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5454413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in graphs: A survey and recent results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hexagonal systems with forcing single edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two minimax theorems in graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimax Theorem for Directed 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: Perfect matchings in hexagonal systems / 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: Q5408293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4903411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hexagonal systems with forcing edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing matching numbers of fullerene graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plane elementary bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5279119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A maximal cover of hexagonal systems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2015.08.024 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:25, 9 December 2024

scientific article; zbMATH DE number 6541329
Language Label Description Also known as
English
Anti-forcing numbers of perfect matchings of graphs
scientific article; zbMATH DE number 6541329

    Statements

    Anti-forcing numbers of perfect matchings of graphs (English)
    0 references
    0 references
    0 references
    0 references
    12 February 2016
    0 references
    plane bipartite graph
    0 references
    hexagonal system
    0 references
    perfect matching
    0 references
    forcing number
    0 references
    anti-forcing number
    0 references
    Fries number
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references