scientific article; zbMATH DE number 786167

MaRDI QIDQ4842744zbMATH OpenFDO

Authors Preben Dahl Vestergaard, John Gimbel

Publication date 23 April 1996

zbMATH Keywords

inequalitytotal matching

Mathematics Subject Classification ID

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

Recommendations

• On total matching numbers and total covering numbers of complementary graphs
• On total domination and minimum maximal matchings in graphs
• Total matchings and total coverings of threshold graphs
• Some results on matching and total domination in graphs
• On matching and total domination in graphs

Cited in

(12)

• Matchings in infinite graphs
• On total matching numbers and total covering numbers of complementary graphs
• On the algorithmic complexity of twelve covering and independence parameters of graphs
• Double total domination of graphs
• Nordhaus--Gaddum bounds for independent domination
• Extremal connected graphs for independent domination number
• On upper transversals in 3-uniform hypergraphs
• On the independent domination number of regular graphs
• Well-covered graphs and factors
• Inequalities involving the irredundance number of a graph
• Cubic graphs with large ratio of independent domination number to domination number
• Nordhaus-Gaddum type inequality for the integer \(k\)-matching number of a graph

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 Q4842744)