The following pages link to Decomposition of Directed Graphs (Q3960725):
Displayed 41 items.
- Recognizing locally equivalent graphs (Q685658) (← links)
- Decomposition of k-ary relations (Q751668) (← links)
- Networks with small stretch number (Q876723) (← links)
- Decomposition of partial orders (Q919013) (← links)
- Circle graphs and monadic second-order logic (Q946577) (← links)
- Solving some NP-complete problems using split decomposition (Q948695) (← links)
- Clique-width of graphs defined by one-vertex extensions (Q998353) (← links)
- Decomposition of submodular functions (Q1053717) (← links)
- A decomposition of distributive lattices (Q1057293) (← links)
- An algorithm for minimizing setups in precedence constrained scheduling (Q1069848) (← links)
- On finding the jump number of a partial order by substitution decomposition (Q1092072) (← links)
- N-free posets as generalizations of series-parallel posets (Q1097286) (← links)
- Isotropic systems (Q1101116) (← links)
- On submodular function minimization (Q1104332) (← links)
- Graphic presentations of isotropic systems (Q1113912) (← links)
- Reducing prime graphs and recognizing circle graphs (Q1116953) (← links)
- \(P_ 4\)-comparability graphs (Q1121924) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- \(P_ 4\)-trees and substitution decomposition (Q1201812) (← links)
- Minimally 3-connected isotropic systems (Q1340133) (← links)
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs (Q1345961) (← links)
- Connectivity and \(\beta\)-invariants of isotropic systems and 4-regular graphs (Q1356405) (← links)
- On the closure of graphs under substitution (Q1377871) (← links)
- PC trees and circular-ones arrangements. (Q1401263) (← links)
- MAD trees and distance-hereditary graphs (Q1408821) (← links)
- Distance labeling scheme and split decomposition (Q1417571) (← links)
- The graph sandwich problem for 1-join composition is NP-complete (Q1613390) (← links)
- Basic perfect graphs and their extensions (Q1779506) (← links)
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures (Q1897475) (← links)
- Compositions for perfect graphs (Q2266722) (← links)
- Mutant knots and intersection graphs (Q2464924) (← links)
- The modular decomposition of countable graphs. Definition and construction in monadic second-order logic (Q2481975) (← links)
- Recognizability, hypergraph operations, and logical types (Q2496296) (← links)
- A contract-based model for directed network formation (Q2507673) (← links)
- Graph decompositions definable in monadic second-order logic (Q3439302) (← links)
- The bi-join decomposition (Q3439330) (← links)
- Digraph Decompositions and Eulerian Systems (Q3781773) (← links)
- Dynamic Distance Hereditary Graphs Using Split Decomposition (Q5387744) (← links)
- A Representation Theorem for Union-Difference Families and Application (Q5458554) (← links)
- Graphs with bounded induced distance (Q5928866) (← links)
- Domination graphs: Examples and counterexamples (Q5936465) (← links)