Matching-perfect and cover-perfect graphs

DOI10.1007/BF02760842zbMath0298.05137MaRDI QIDQ1214445

Mordechai Lewin

Publication date: 1975

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph theory (05C99) Combinatorial aspects of packing and covering (05B40)

Related Items

Equimatchable Graphs on Surfaces, WELL-COVERED GRAPHS: A SURVEY, Equimatchable claw-free graphs, On well-edge-dominated graphs, Triangle‐free equimatchable graphs, Equimatchable Regular Graphs, Graphs vertex-partitionable into strong cliques, ModelingK-coteries by well-covered graphs, On three extensions of equimatchable graphs, On two extensions of equimatchable graphs, Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\), On two equimatchable graph classes, Bounding the size of equimatchable graphs of fixed genus, Edge-Critical Equimatchable Bipartite Graphs, Equimatchable bipartite graphs, Efficient recognition of equimatchable graphs, Well-covered graphs and extendability

Cites Work

• A note on line coverings of graphs
• Matchings in polytopal graphs