Forcing and anti-forcing edges in bipartite graphs (Q1752588): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2018.03.027 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2018.03.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2795052996 / 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: Q3813828 / 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: Anti-forcing spectra of perfect matchings of 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: Hexagonal systems with forcing single edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395507 / 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: On the anti-forcing number of fullerene graphs / 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: Forcing matching numbers of fullerene graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4903411 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2018.03.027 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:17, 11 December 2024

scientific article
Language Label Description Also known as
English
Forcing and anti-forcing edges in bipartite graphs
scientific article

    Statements

    Forcing and anti-forcing edges in bipartite graphs (English)
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    anti-forcing edge
    0 references
    forcing single edge
    0 references
    forcing edge
    0 references
    forcing double edge
    0 references
    \(e\)-anti-forcing path
    0 references
    \(e\)-forcing path
    0 references

    Identifiers