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-ZzbMATH Open1338.05084OpenAlexW1699073913MaRDI QIDQ293628FDOQ293628

Authors: Johannes H. Hattingh, O. A. Saleh, Lucas van der Merwe, T. 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

Recommendations

• Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement
• Product Nordhaus-Gaddum-type results for the induced path number involving complements with respect to \(K_n\) or \(K_{n,n}\)
• A Nordhaus-Gaddum-type result for the induced path number
• scientific article; zbMATH DE number 2230916
• Nordhaus-Gaddum type results for the induced path number with relative complements in \(K_{m,n}\)

zbMATH Keywords

productinduced path numberNordhaus-Gaddum results

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Domination-balanced graphs
• 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
• Product Nordhaus-Gaddum-type results for the induced path number involving complements with respect to \(K_n\) or \(K_{n,n}\)
• On Complementary Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• Induced path factors of regular graphs
• Nordhaus-Gaddum type results for the induced path number with relative complements in \(K_{m,n}\)
• Title not available (Why is that?)
• Ramsey-type problems on induced covers and induced partitions toward the Gyárfás-Sumner conjecture
• A Nordhaus-Gaddum-type result for the induced path number
• Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs
• Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement
• Product Nordhaus-Gaddum-type results for the induced path number involving complements with respect to \(K_n\) or \(K_{n,n}\)

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

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