Matchings in polytopal graphs

DOI10.1002/net.3230040207zbMath0294.05104OpenAlexW2111831663MaRDI QIDQ4046067

Branko Grünbaum

Publication date: 1974

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230040207

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)

Related Items (23)

Pentagonal 3-polytopal graphs with edges of only two types and shortness parameters ⋮ Equimatchable Graphs on Surfaces ⋮ WELL-COVERED GRAPHS: A SURVEY ⋮ Equimatchable claw-free graphs ⋮ Paarweise kantendisjunkte maximale matchings in normalen periodischen Pflasterungen. (On pairwise edge-disjoint maximal matchings in normal periodic tilings) ⋮ Lower bounds on the cardinality of the maximum matchings of planar graphs ⋮ Triangle‐free equimatchable graphs ⋮ Equimatchable Regular Graphs ⋮ Graphs vertex-partitionable into strong cliques ⋮ On two extensions of equimatchable graphs ⋮ On face vectors and vertex vectors of convex polyhedra ⋮ Matching-perfect and cover-perfect graphs ⋮ A linear algorithm for disjoint matchings in trees ⋮ Coverings by minimal transversals ⋮ Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) ⋮ Triangles with restricted degrees of their boundary vertices in plane triangulations ⋮ Subgraphs with restricted degrees of their vertices in planar graphs ⋮ On the simplicial 3-polytopes with only two types of edges ⋮ Edge-Critical Equimatchable Bipartite Graphs ⋮ Equimatchable bipartite graphs ⋮ Well-covered graphs and extendability ⋮ Optimal vertex ordering of graphs ⋮ On the cuts and cut number of the 4-cube

Cites Work

• On the Number of Disjoint Edges in a Graph
• On the Number of Vertices of a Convex Polytope
• Unnamed Item

This page was built for publication: Matchings in polytopal graphs