FACTORIZATION OF EVEN GRAPHS
From MaRDI portal
Cited in
(21)- Matching theory -- a sampler: From Dénes König to the present
- Marriage in denumerable societies
- Matroids on partially ordered sets
- Pisot substitution sequences, one dimensional cut-and-project sets and bounded remainder sets with fractal boundary
- Hölder stability estimates for some inverse pointwise source problems
- Bounded displacement non-equivalence in substitution tilings
- Number of bounded distance equivalence classes in hulls of repetitive Delone sets
- Connected \(k\)-factors in bipartite graphs
- A factorization theorem for a certain class of graphs
- Unimodular modules
- Lipschitz stability estimates for an inverse source problem in an elliptic equation from interior measurements
- Matrices of zeros and ones
- Closed Sets Without Measurable Matching
- A dichotomy for bounded displacement equivalence of Delone sets
- On factorisation of graphs
- Systems of representatives
- Paradoxical decompositions using Lipschitz functions
- Divergence of separated nets with respect to displacement equivalence
- Catalan numbers as discrepancies for a family of substitutions on infinite alphabets
- Spectral conditions for k-extendability and k-factors of bipartite graphs
- Graph factors and factorization: 1985--2003: a survey
This page was built for publication: FACTORIZATION OF EVEN GRAPHS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5790395)