Matchings in polytopal graphs
From MaRDI portal
Publication:4046067
Cites work
Cited in
(23)- Matching-perfect and cover-perfect graphs
- A linear algorithm for disjoint matchings in trees
- On two extensions of equimatchable graphs
- Triangle‐free equimatchable graphs
- On the simplicial 3-polytopes with only two types of edges
- Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)
- On the cuts and cut number of the 4-cube
- Edge-Critical Equimatchable Bipartite Graphs
- Lower bounds on the cardinality of the maximum matchings of planar graphs
- On face vectors and vertex vectors of convex polyhedra
- Equimatchable claw-free graphs
- Triangles with restricted degrees of their boundary vertices in plane triangulations
- Optimal vertex ordering of graphs
- Well-covered graphs and extendability
- Subgraphs with restricted degrees of their vertices in planar graphs
- Equimatchable bipartite graphs
- Graphs vertex-partitionable into strong cliques
- Equimatchable regular graphs
- Paarweise kantendisjunkte maximale matchings in normalen periodischen Pflasterungen. (On pairwise edge-disjoint maximal matchings in normal periodic tilings)
- Equimatchable Graphs on Surfaces
- WELL-COVERED GRAPHS: A SURVEY
- Pentagonal 3-polytopal graphs with edges of only two types and shortness parameters
- Coverings by minimal transversals
This page was built for publication: Matchings in polytopal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4046067)