Some nordhaus‐‐ gaddum‐type results

DOI10.1002/jgt.3190160305zbMath0774.05095OpenAlexW2074690936MaRDI QIDQ4013424

Henda C. Swart, Wayne Goddard, Michael A. Henning

Publication date: 27 September 1992

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

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

zbMATH Keywords

independencecomplete bipartite graphfactorizationdominationNordhaus-Gaddum-type

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (11)

NORDHAUS–GADDUM-TYPE THEOREM FOR DIAMETER OF GRAPHS WHEN DECOMPOSING INTO MANY PARTS ⋮ Maximum size of digraphs with some parameters ⋮ Nordhaus-Gaddum bounds for upper total domination ⋮ Nordhaus-Gaddum type result for the matching number of a graph ⋮ A Nordhaus-Gaddum-type result for the induced path number ⋮ Multiple factor Nordhaus-Gaddum type results for domination and total domination ⋮ Nordhaus-Gaddum bounds for total domination ⋮ Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts ⋮ Connected domination critical graphs with respect to relative complements ⋮ Nordhaus-Gaddum type inequality for the fractional matching number of a graph ⋮ Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars

This page was built for publication: Some nordhaus‐‐ gaddum‐type results