On mirror nodes in graphs without long induced paths

zbMATH Open1278.05196MaRDI QIDQ2869308FDOQ2869308

Authors: Katharina Hammersen, Bert Randerath 

Publication date: 3 January 2014

Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/55/ajc_v55_p263.pdf

Recommendations

• On maximum independent sets in \(P_{5}\)-free graphs
• Maximum independent sets in subclasses of \(P_{5}\)-free graphs
• Linear time algorithms on mirror trees
• Some results on graphs without long induced paths
• On the maximum weight independent set problem in graphs without induced cycles of length at least five

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

This page was built for publication: On mirror nodes in graphs without long induced paths

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