Recognition algorithm for P₄-tidy graphs

MaRDI QIDQ4642251zbMATH OpenFDO

Authors Mihai Talmaciu

Publication date 22 May 2018

zbMATH Keywords

\(P_4\)-tidy graphsquasi-spider graphsrecognition algorithmspider graphsweak decomposition

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 1375569
• An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs
• Minimal separators in P₄-tidy graphs
• Restricted coloring problems on graphs with few P'_4s
• Clique-perfectness and balancedness of some graph classes

Cited in

(7)

• Algorithms for \(P_4\)-comparability graph recognition and acyclic \(P_4\)-transitive orientation
• An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs
• scientific article; zbMATH DE number 4206028 (Why is no real title available?)
• scientific article; zbMATH DE number 1375569 (Why is no real title available?)
• scientific article; zbMATH DE number 1953107 (Why is no real title available?)
• scientific article; zbMATH DE number 2081001 (Why is no real title available?)
• Efficiently recognizing the P₄-structure of trees and of bipartite graphs without short cycles

This page was built for publication: Recognition algorithm for \(P_4\)-tidy graphs

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