Pages that link to "Item:Q1201812"
From MaRDI portal
The following pages link to \(P_ 4\)-trees and substitution decomposition (Q1201812):
Displaying 50 items.
- The homogeneous set sandwich problem (Q293307) (← links)
- 3-minimal triangle-free graphs (Q397131) (← links)
- Decomposition tree of a lexicographic product of binary structures (Q409340) (← links)
- 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)
- Algorithmic aspects of switch cographs (Q906430) (← 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)
- On the \(p\)-connectedness of graphs---a survey (Q1302141) (← links)
- A \(k\)-structure generalization of the theory of 2-structures (Q1334662) (← links)
- Recognizing the \(P_ 4\)-structures of a tree (Q1343225) (← 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)
- The \(\{-2,-1\}\)-selfdual and decomposable tournaments (Q1649912) (← links)
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs (Q1730221) (← links)
- Linear-time modular decomposition of directed graphs (Q1764805) (← links)
- The sandwich problem for decompositions and almost monotone properties (Q1799213) (← 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)
- Finite orders which are reconstructible up to duality by their comparability graphs (Q1988547) (← links)
- Making a tournament indecomposable by one subtournament-reversal operation (Q2045379) (← links)
- Editing to prime graphs (Q2049029) (← links)
- Prime 3-uniform hypergraphs (Q2053735) (← links)
- Critical 3-hypergraphs (Q2108059) (← links)
- Tournaments with maximal decomposability (Q2144570) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- Prime orientable graphs (Q2237224) (← links)
- Decomposability index of tournaments (Q2404390) (← links)
- Indecomposability graph and indecomposability recognition (Q2434744) (← links)
- Counting spanning trees using modular decomposition (Q2437761) (← links)
- Recognition of prime graphs from a prime subgraph (Q2449165) (← links)
- Triangle-free graphs which are minimal for some nonstable 4-vertex subset (Q2515449) (← links)
- Convex circuit-free coloration of an oriented graph (Q2519795) (← links)
- Decomposability and co-modular indices of tournaments (Q2659184) (← links)
- Some Algorithms on Conditionally Critical Indecomposable Graphs (Q3439358) (← links)
- Cut-primitive directed graphs versus clan-primitive directed graphs (Q3576334) (← links)
- (Q4963168) (← links)
- (Q5144372) (← links)
- (Q5708507) (← links)
- (Q5863836) (← links)
