Construction for bicritical graphs and \(k\)-extendable bipartite graphs (Q2497479): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / 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: Computing Vertex Connectivity: New Bounds from Old Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the extendability problem in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Problems: Duality Relations and a New Method of Solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of factorizable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching structure and the matching lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Family of Planar Bicritical 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: Q3261003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the edge connectivity of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brace generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending matchings in graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On n-extendable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory -- a sampler: From Dénes König to the present / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the number of perfect matchings of bipartite graphs / rank
 
Normal rank

Revision as of 17:32, 24 June 2024

scientific article
Language Label Description Also known as
English
Construction for bicritical graphs and \(k\)-extendable bipartite graphs
scientific article

    Statements

    Construction for bicritical graphs and \(k\)-extendable bipartite graphs (English)
    0 references
    0 references
    0 references
    4 August 2006
    0 references
    perfect matching
    0 references
    bicritical graph
    0 references
    factor-critical graph
    0 references
    transversal
    0 references
    \(k\)-extendable graph
    0 references
    extendability
    0 references

    Identifiers