Pages that link to "Item:Q1201812"
From MaRDI portal
The following pages link to \(P_ 4\)-trees and substitution decomposition (Q1201812):
Displayed 23 items.
- An algorithm for finding homogeneous pairs (Q674438) (← links)
- On the structure of bull-free perfect graphs (Q675887) (← links)
- Note on the homogeneous set sandwich problem (Q834997) (← links)
- Critically indecomposable graphs (Q1003768) (← links)
- The recognition of the class of indecomposable digraphs under low hemimorphy (Q1025969) (← links)
- Indecomposability graph and critical vertices of an indecomposable graph (Q1043637) (← links)
- Transitive closure for restricted classes of partial orders (Q1182064) (← links)
- Modular decomposition and transitive orientation (Q1301738) (← links)
- A \(k\)-structure generalization of the theory of 2-structures (Q1334662) (← links)
- \(P_{4}\)-laden graphs: A new class of brittle graphs (Q1349998) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- Minimal indecomposable graphs (Q1382817) (← links)
- On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs (Q1390873) (← links)
- The \(C_{3}\)-structure of the tournaments. (Q1426106) (← links)
- The closure of monadic NP (Q1577017) (← links)
- An efficient algorithm for solving the homogeneous set sandwich problem (Q1607076) (← links)
- The graph sandwich problem for 1-join composition is NP-complete (Q1613390) (← links)
- Linear-time modular decomposition of directed graphs (Q1764805) (← links)
- A linear algorithm to decompose inheritance graphs into modules (Q1892582) (← links)
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures (Q1897475) (← links)
- Convex circuit-free coloration of an oriented graph (Q2519795) (← links)
- Some Algorithms on Conditionally Critical Indecomposable Graphs (Q3439358) (← links)
- (Q5708507) (← links)