A Nordhaus-Gaddum-type result for the induced path number

DOI10.1007/S10878-011-9388-0zbMath1261.90072OpenAlexW2038100070MaRDI QIDQ1928519

Johannes H. Hattingh, Terry J. Walters, Lucas C. Van Der Merwe, Ossama A. Saleh

Publication date: 3 January 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9388-0

zbMATH Keywords

induced path numberNordhaus-Gaddum

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• On Complementary Graphs
• Domination-balanced graphs
• Some nordhaus‐‐ gaddum‐type results
• Bounds on chromatic numbers of multiple factors of a complete graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Nordhaus-Gaddum-type result for the induced path number