The following pages link to Decomposition of Directed Graphs (Q3960725):
Displaying 50 items.
- Between treewidth and clique-width (Q300479) (← links)
- Notes on a theorem of Naji (Q329556) (← links)
- Minimal strong digraphs (Q409422) (← links)
- Tree-representation of set families and applications to combinatorial decompositions (Q412262) (← links)
- Reduced clique graphs of chordal graphs (Q412263) (← links)
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- Prechains and self duality (Q418880) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Practical and efficient circle graph recognition (Q472484) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- The external constraint 4 nonempty part sandwich problem (Q531610) (← links)
- Partial characterizations of circle graphs (Q643006) (← links)
- Enumerations, forbidden subgraph characterizations, and the split-decomposition (Q668013) (← links)
- Recognizing locally equivalent graphs (Q685658) (← links)
- Splitting cubic circle graphs (Q726651) (← links)
- Isotropic matroids. I: Multimatroids and neighborhoods (Q727168) (← links)
- Unavoidable vertex-minors in large prime graphs (Q740266) (← links)
- Excluded vertex-minors for graphs of linear rank-width at most \(k\) (Q740279) (← links)
- Decomposition of k-ary relations (Q751668) (← links)
- Networks with small stretch number (Q876723) (← links)
- Meta-kernelization with structural parameters (Q896025) (← 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)
- Diamond-free circle graphs are Helly circle (Q965965) (← links)
- \(O(m\log n)\) split decomposition of strongly-connected graphs (Q972339) (← links)
- Clique-width of graphs defined by one-vertex extensions (Q998353) (← links)
- On an extension of distance hereditary graphs (Q1025561) (← links)
- Treelike comparability graphs (Q1026130) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← 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)
