Tree-like P₄-connected graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(9)- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- The 4-set tree connectivity of \((n, k)\)-star networks
- On a unique tree representation for \(P_ 4\)-extendible graphs
- scientific article; zbMATH DE number 4068899 (Why is no real title available?)
- Endomorphism-regularity of split graphs
- scientific article; zbMATH DE number 4168710 (Why is no real title available?)
- Recognizing the \(P_ 4\)-structures of a tree
- Recognition and isomorphism of tree-like \(P_4\)-connected graphs
- A new characterization of \(P_4\)-connected graphs
This page was built for publication: Tree-like \(P_4\)-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584426)