Nordhaus-Gaddum results for the induced path number of a graph when neither the graph nor its complement contains isolates

DOI10.1007/S00373-015-1629-ZzbMath1338.05084OpenAlexW1699073913MaRDI QIDQ293628

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

Publication date: 9 June 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1629-z

zbMATH Keywords

productinduced path numberNordhaus-Gaddum results

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Induced path factors of regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On connected cutfree domination in graphs
• Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement
• A survey of Nordhaus-Gaddum type relations
• On Complementary Graphs
• Domination-balanced graphs

This page was built for publication: Nordhaus-Gaddum results for the induced path number of a graph when neither the graph nor its complement contains isolates