Finding maximum square-free 2-matchings in bipartite graphs (Q2498740): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3258698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matching problem with side conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching, matroids, and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted 2-factor polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lehmans switching game and a theorem of Tutte and Nash-Williams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted \(t\)-matchings in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263715 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Restricted Two-Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factors of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Short Proof of the Factor Theorem for Finite Graphs / rank
 
Normal rank

Latest revision as of 18:15, 24 June 2024

scientific article
Language Label Description Also known as
English
Finding maximum square-free 2-matchings in bipartite graphs
scientific article

    Statements

    Identifiers