Cites work
- scientific article; zbMATH DE number 3526726 (Why is no real title available?)
- A Combinatorial Decomposition Theory
- A Fast Algorithm for the Decomposition of Graphs and Posets
- Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
- Graph derivatives
- Graph theory with applications
- On certain polytopes associated with graphs
- On the X-join decomposition for undirected graphs
Cited in
(only showing first 100 items - show all)- An algorithm for minimizing setups in precedence constrained scheduling
- The rank-width of edge-coloured graphs
- Digraphs of bounded width
- A contract-based model for directed network formation
- Circle graph isomorphism in almost linear time
- A BRACKET POLYNOMIAL FOR GRAPHS, III: VERTEX WEIGHTS
- Clique-width of graphs defined by one-vertex extensions
- Some results on more flexible versions of Graph Motif
- Excluded vertex-minors for graphs of linear rank-width at most \(k\)
- Enumerations, forbidden subgraph characterizations, and the split-decomposition
- Between treewidth and clique-width
- PC trees and circular-ones arrangements.
- Solving problems on graphs of high rank-width
- Topology and counting of real algebraic curves
- Mutant knots and intersection graphs
- Distance-hereditary comparability graphs
- On computing the Gromov hyperbolicity
- Digraph Decompositions and Eulerian Systems
- Optimal centrality computations within bounded clique-width graphs
- Isotropic matroids. III: Connectivity
- Representations of graphs and networks (coding, layouts and embeddings)
- Prechains and self duality
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- MAD trees and distance-hereditary graphs
- A 2-isomorphism theorem for delta-matroids
- Recognizability, hypergraph operations, and logical types
- scientific article; zbMATH DE number 7559376 (Why is no real title available?)
- N-free posets as generalizations of series-parallel posets
- On an extension of distance hereditary graphs
- Minimal strong digraphs
- Graphs with bounded induced distance
- Tree-representation of set families and applications to combinatorial decompositions
- \(O(m\log n)\) split decomposition of strongly-connected graphs
- Rank connectivity and pivot-minors of graphs
- Unavoidable vertex-minors in large prime graphs
- Graph decompositions definable in monadic second-order logic
- \((\leq k)\)-reconstructible binary relations
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- \(P_ 4\)-comparability graphs
- A Representation Theorem for Union-Difference Families and Application
- Polynomial-time recognition of clique-width 3 graphs
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- Dynamic Distance Hereditary Graphs Using Split Decomposition
- The bi-join decomposition
- Isotropic systems
- A polynomial kernel for 3-leaf power deletion
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond
- Extending partial representations of circle graphs in near-linear time
- Distance-hereditary comparability graphs
- Decomposition of submodular functions
- The graph sandwich problem for 1-join composition is NP-complete
- O(m n) split decomposition of strongly connected graphs
- On complexities of minus domination
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- Splitting cubic circle graphs
- Between treewidth and clique-width
- Reduced clique graphs of chordal graphs
- Hypergraphs with polynomial representation: introducing \(r\)-splits
- Weighted interlace polynomials
- The external constraint 4 nonempty part sandwich problem
- A matrix description of weakly bipartitive and bipartitive families
- Distance labeling scheme and split decomposition
- Networks with small stretch number
- Scattered classes of graphs
- Word-representability of graphs with respect to split recomposition
- A bracket polynomial for graphs. IV: Undirected Euler circuits, graph-links and multiply marked graphs
- A decomposition of distributive lattices
- Solving some NP-complete problems using split decomposition
- Applying clique-decomposition for computing Gromov hyperbolicity
- Practical and efficient split decomposition via graph-labelled trees
- From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals
- Notes on a theorem of Naji
- 2-nested matrices: towards understanding the structure of circle graphs
- A structure theorem for graphs with no cycle with a unique chord and its consequences
- Using split composition to extend distance-hereditary graphs in a generative way (extended abstract)
- \(P_ 4\)-trees and substitution decomposition
- Recognizing locally equivalent graphs
- A survey of the algorithmic aspects of modular decomposition
- Practical and efficient circle graph recognition
- On finding the jump number of a partial order by substitution decomposition
- Tree pivot-minors and linear rank-width
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs
- Decomposition of k-ary relations
- Treelike comparability graphs
- Meta-kernelization with structural parameters
- scientific article; zbMATH DE number 7561384 (Why is no real title available?)
- Partial characterizations of circle graphs
- Decomposition of partial orders
- Solving problems on graphs of high rank-width
- The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
- Graph isomorphism restricted by lists
- On the structure of graph product von Neumann algebras
- The sandwich problem for decompositions and almost monotone properties
- Circle graphs and monadic second-order logic
- Scaling limit of graph classes through split decomposition
- Diamond-free circle graphs are Helly circle
- Bipartite graphs totally decomposable by canonical decomposition
- Grammars and clique-width bounds from split decompositions
This page was built for publication: Decomposition of Directed Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3960725)
