Randomly matchable graphs
From MaRDI portal
Publication:4189320
DOI10.1002/jgt.3190030209zbMath0404.05053OpenAlexW2158210207WikidataQ56001821 ScholiaQ56001821MaRDI QIDQ4189320
Publication date: 1979
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190030209
Related Items
A characterization of claw-free CIS graphs and new results on the order of CIS graphs ⋮ The cost of perfection for matchings in graphs ⋮ A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs ⋮ Totally equimatchable graphs ⋮ Equimatchable Graphs on Surfaces ⋮ Equimatchable claw-free graphs ⋮ On 4-connected claw-free well-covered graphs ⋮ Hardness and approximation of minimum maximal matchings ⋮ Randomly planar graphs ⋮ Global forcing number for maximal matchings in corona products ⋮ Edge-stable equimatchable graphs ⋮ On well-edge-dominated graphs ⋮ Triangle‐free equimatchable graphs ⋮ Global forcing number for maximal matchings ⋮ Graphs with each edge in at most one maximum matching ⋮ Equimatchable Regular Graphs ⋮ Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations ⋮ Unnamed Item ⋮ Equistable simplicial, very well-covered, and line graphs ⋮ Vertex-transitive CIS graphs ⋮ A short update on equipackable graphs ⋮ On the ratio between the maximum weight of a perfect matching and the maximum weight of a matching ⋮ The hardness of the independence and matching clutter of a graph ⋮ Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) ⋮ On two equimatchable graph classes ⋮ Unnamed Item ⋮ Greedily constructing maximal partial \(f\)-factors ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Bounding the size of equimatchable graphs of fixed genus ⋮ Randomly H-coverable graphs ⋮ Edge-Critical Equimatchable Bipartite Graphs ⋮ On regular-stable graphs ⋮ Equimatchable bipartite graphs ⋮ Efficient recognition of equimatchable graphs ⋮ Unnamed Item ⋮ Random packings of graphs
