scientific article; zbMATH DE number 3869366

MaRDI QIDQ3337498zbMATH OpenFDO

Authors Arthur M. Farley, Andrzej Proskurowski

Publication date 1984

zbMATH Keywords

matching immune graphs

Mathematics Subject Classification ID

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

Recommendations

• Extremal graphs having no matching cuts
• A characterization of extremal graphs with no matching-cut
• Minimal graphs for matching extensions
• Minimum number of vertices of graphs without perfect matching, with given edge connectivity and minimum and maximum degrees
• The connectivity of maximum matching graphs

Cited in

(8)

• Note on extremal graphs with given matching number
• Extremal graphs having no stable cutset
• Extremal graphs having no matching cuts
• A characterization of extremal graphs with no matching-cut
• Good edge-labelling of graphs
• Good edge-labelling of graphs
• On the SPANNING k-TREE problem
• On stable cutsets in claw-free graphs and planar graphs

This page was built for publication:

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