Maximum matchings in regular graphs of high girth
From MaRDI portal
Publication:870087
zbMATH Open1111.05080MaRDI QIDQ870087FDOQ870087
Authors: Abraham D. Flaxman, Shlomo Hoory 
Publication date: 12 March 2007
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/127271
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Maximum matchings in regular graphs
- Maximum matching in regular and almost regular graphs
- On maximum matchings in almost regular graphs
- Maximum matchings in a regular graph of specified connectivity and bounded order
- On maximal matchings of connected graphs
- Matchings in graphs of odd regularity and girth
- Tight lower bounds on the size of a maximum matching in a regular graph
- A note on a conjecture on maximum matching in almost regular graphs
- Maximum matchings in a class of random graphs
- scientific article; zbMATH DE number 2114098
Cited In (18)
- A note on a conjecture on maximum matching in almost regular graphs
- Matchings in graphs of odd regularity and girth
- On disjoint matchings in cubic graphs
- On maximum \(k\)-edge-colorable subgraphs of bipartite graphs
- Lower bounds on the uniquely restricted matching number
- Uniquely restricted matchings in subcubic graphs without short cycles
- Local boxicity
- The Monochromatic Circumference of 2‐Edge‐Colored Graphs
- A lower bound on the acyclic matching number of subcubic graphs
- Minimum k‐cores and the k‐core polytope
- Graphs, disjoint matchings and some inequalities
- The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability
- Maximal matchings in graphs with large neighborhoods of independent vertices
- On the Size of Matchings in 1-Planar Graph with High Minimum Degree
- On maximum matchings in König-Egerváry graphs
- The matching process and independent process in random regular graphs and hypergraphs
- Flipping triangles and rectangles
- Matchings in regular graphs: minimizing the partition function
This page was built for publication: Maximum matchings in regular graphs of high girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870087)
