Decomposition theorems for square-free 2-matchings in bipartite graphs (Q2410265): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.2017.07.035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2745336117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for even factors and square-free simple \(b\)-matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted b-Matchings in Degree-Bounded Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3258698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding 2-Factors Closer to TSP Tours in Cubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem on cubic and subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matching problem with side conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSP Tours in Cubic Graphs: Beyond 4/3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching, matroids, and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coverings of Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted \(t\)-matchings in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5520564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5508779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263715 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding maximum square-free 2-matchings in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Cardinality Simple 2-matchings in Subcubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedron of triangle-free simple 2-matchings in subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3333053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-free 2-matchings and M-concave functions on jump systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Cunningham's conjecture on restricted subgraphs and jump systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Maximum Cost $K_{t,t}$‐Free <i>t</i>‐Matchings of Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices and matroids for systems analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial algorithms for matchings, even factors and square-free 2-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: A Weighted <i>k<sub>t, t</sub></i>-Free <i>t</i>-Factor Algorithm for Bipartite Graphs / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:26, 14 July 2024

scientific article
Language Label Description Also known as
English
Decomposition theorems for square-free 2-matchings in bipartite graphs
scientific article

    Statements

    Decomposition theorems for square-free 2-matchings in bipartite graphs (English)
    0 references
    0 references
    17 October 2017
    0 references
    0 references
    matching theory
    0 references
    square-free 2-matching
    0 references
    Dulmage-Mendelsohn decomposition
    0 references
    Edmonds-Gallai decomposition
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references