Pages that link to "Item:Q1962050"
From MaRDI portal
The following pages link to Recognition and isomorphism of tree-like \(P_4\)-connected graphs (Q1962050):
Displaying 11 items.
- On a unique tree representation for \(P_ 4\)-extendible graphs (Q1182318) (← links)
- On the \(p\)-connectedness of graphs---a survey (Q1302141) (← links)
- Tree- and forest-perfect graphs (Q1302153) (← links)
- Recognizing the \(P_ 4\)-structures of a tree (Q1343225) (← links)
- Tree-like \(P_4\)-connected graphs (Q1584426) (← links)
- A time-based solution for the graph isomorphism problem (Q2192286) (← links)
- (Q4414511) (← links)
- (Q4474099) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
- Efficiently recognizing the \(P_4\)-structure of trees and of bipartite graphs without short cycles (Q5935599) (← links)