Basilica: new canonical decomposition in matching theory
From MaRDI portal
Publication:6667586
DOI10.1002/jgt.23190MaRDI QIDQ6667586
Publication date: 20 January 2025
Published in: Journal of Graph Theory (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Brick decompositions and the matching rank of graphs
- Matching theory
- Matching structure and the matching lattice
- Perfect matchings versus odd cuts
- An algebraic matching algorithm
- Structure of towers and a new proof of the tight cut lemma
- Nonbipartite Dulmage-Mendelsohn decomposition for Berge duality
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On a matroid defined by ear-decompositions of graphs
- Conservative weightings and ear-decompositions of graphs
- Submodular functions and optimization.
- Direct methods for sparse matrices
- Disclosing Barriers: A Generalization of the Canonical Partition Based on Lovász’s Formulation
- AN ALTERNATIVE PROOF OF LOVASZ'S CATHEDRAL THEOREM
- Coverings of Bipartite Graphs
- Rank of maximum matchings in a graph
- A Partially Ordered Structure and a Generalization of the Canonical Partition for General Graphs with Perfect Matchings
- Paths, Trees, and Flowers
- On the structure of factorizable graphs
- Two Algorithms for Bipartite Graphs
- On generalizations of matching-covered graphs
This page was built for publication: Basilica: new canonical decomposition in matching theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6667586)
