Pages that link to "Item:Q673108"
From MaRDI portal
The following pages link to A linear-time recognition algorithm for \(P_{4}\)-reducible graphs (Q673108):
Displaying 9 items.
- Path-bicolorable graphs (Q659746) (← links)
- On bipartite graphs with weak density of some subgraphs (Q878650) (← links)
- The graph sandwich problem for \(P_4\)-sparse graphs (Q1025565) (← links)
- A fast parallel algorithm to recognize P4-sparse graphs (Q1382265) (← links)
- On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs (Q1390873) (← links)
- Cross-series-parallel digraphs (Q1983112) (← links)
- On some domination colorings of graphs (Q2399288) (← links)
- Efficient parallel recognition of cographs (Q2565857) (← links)
- A representation for the modular-pairs of a P4-reducible graph by modular decomposition (Q3439346) (← links)
