Extending matchings in graphs: A survey (Q1322235): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: N‐extendability of symmetric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The matching extendability of surfaces / 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: Toughness and the existence ofk-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbourhood unions and Hamiltonian properties in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5547252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 2-extendability of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4729833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The statistics of dimers on a lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs / 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: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5534009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank of maximum matchings in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5591378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3784090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On n-extendable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and matching extension in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4732491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching extension and the genus of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending matchings in planar graphs. IV / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic coloration of 3-polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5599567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on paths in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3847965 / rank
 
Normal rank

Latest revision as of 14:32, 22 May 2024

scientific article
Language Label Description Also known as
English
Extending matchings in graphs: A survey
scientific article

    Statements

    Extending matchings in graphs: A survey (English)
    0 references
    0 references
    20 October 1994
    0 references
    decomposition
    0 references
    matchings
    0 references
    \(t\)-factor
    0 references
    bicritical graphs
    0 references
    \(n\)-extendable
    0 references
    genus
    0 references
    toughness
    0 references
    claw-freedom
    0 references
    degree sums
    0 references
    planar graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers