The following pages link to Matchings in polytopal graphs (Q4046067):
Displaying 23 items.
- On face vectors and vertex vectors of convex polyhedra (Q685585) (← links)
- Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) (Q738850) (← links)
- On the simplicial 3-polytopes with only two types of edges (Q791872) (← links)
- On the cuts and cut number of the 4-cube (Q1073345) (← links)
- Paarweise kantendisjunkte maximale matchings in normalen periodischen Pflasterungen. (On pairwise edge-disjoint maximal matchings in normal periodic tilings) (Q1121531) (← links)
- Lower bounds on the cardinality of the maximum matchings of planar graphs (Q1135291) (← links)
- Matching-perfect and cover-perfect graphs (Q1214445) (← links)
- A linear algorithm for disjoint matchings in trees (Q1245850) (← links)
- Coverings by minimal transversals (Q1252245) (← links)
- Triangles with restricted degrees of their boundary vertices in plane triangulations (Q1297408) (← links)
- Well-covered graphs and extendability (Q1318795) (← links)
- Pentagonal 3-polytopal graphs with edges of only two types and shortness parameters (Q1343788) (← links)
- Subgraphs with restricted degrees of their vertices in planar graphs (Q1584434) (← links)
- Optimal vertex ordering of graphs (Q1607014) (← links)
- Equimatchable claw-free graphs (Q1660273) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- On two extensions of equimatchable graphs (Q1751251) (← links)
- Equimatchable bipartite graphs (Q2107742) (← links)
- Equimatchable Graphs on Surfaces (Q3466352) (← links)
- WELL-COVERED GRAPHS: A SURVEY (Q4288045) (← links)
- Equimatchable Regular Graphs (Q4604013) (← links)
- Edge-Critical Equimatchable Bipartite Graphs (Q5014683) (← links)
- Triangle‐free equimatchable graphs (Q6057652) (← links)
