Maximal matchings in graphs with large neighborhoods of independent vertices

DOI10.1002/JGT.3190140204zbMATH Open0736.05064OpenAlexW1976844427MaRDI QIDQ4713005FDOQ4713005

C. H. C. Little, Ingrid Rinsma, Douglas R. Woodall

Publication date: 25 June 1992

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190140204

Recommendations

• On maximal matchings of connected graphs
• Maximum matchings in a class of random graphs
• Maximum induced matchings in graphs
• Maximum matching in regular and almost regular graphs
• On maximum matchings in almost regular graphs
• Maximum matchings in general graphs through randomization
• The connectivity of maximum matching graphs
• Maximum matchings in regular graphs of high girth
• Graphs with maximal induced matchings of the same size
• Matching and edge-connectivity in graphs with given maximum degree

zbMATH Keywords

maximal matchings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (2)

• Title not available (Why is that?)
• Forbidden subgraphs and bounds on the size of a maximum matching

This page was built for publication: Maximal matchings in graphs with large neighborhoods of independent vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4713005)