Transitiv orientierbare Graphen
From MaRDI portal
Publication:5534028
Cites work
Cited in
(only showing first 100 items - show all)- Bisplit graphs
- Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
- Unique factorization of compositive hereditary graph properties
- Partial characterizations of circle graphs
- \(P_ 4\)-trees and substitution decomposition
- On opposition graphs, coalition graphs, and bipartite permutation graphs
- On sources in comparability graphs, with applications
- Generalized line graphs: Cartesian products and complexity of recognition
- Balanced Cohen-Macaulay Complexes
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
- Indecomposable graphs
- On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems
- Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
- The Erdős–Gyárfás function with respect to Gallai‐colorings
- \((\leqslant k)\)-half-reconstructible tournaments for \(k\leqslant 6\)
- Edge-colorings avoiding rainbow and monochromatic subgraphs
- Dynamic Distance Hereditary Graphs Using Split Decomposition
- A simple linear time algorithm for cograph recognition
- Gallai-Ramsey numbers of odd cycles and complete bipartite graphs
- On computing the Gromov hyperbolicity
- Comparability graphs and a new matroid
- Linear-time modular decomposition of directed graphs
- An antipode formula for the natural Hopf algebra of a set operad.
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
- On the X-join decomposition for undirected graphs
- Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments
- What is reconstruction for ordered sets?
- Prechains and self duality
- The morphology of infinite tournaments; application to the growth of their profile
- Decomposition tree of a lexicographic product of binary structures
- Nash equilibria and values through modular partitions in infinite games
- A note on perfect graphs
- Treewidth for graphs with small chordality
- 3-minimal triangle-free graphs
- Tree-representation of set families and applications to combinatorial decompositions
- Pairs of orthogonal countable ordinals
- Cut-primitive directed graphs versus clan-primitive directed graphs
- Hereditary unigraphs and Erdős-Gallai equalities
- The complexity of comparability graph recognition and coloring
- Induced matchings in asteroidal triple-free graphs
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Induced matchings in intersection graphs.
- The \(C_{3}\)-structure of the tournaments.
- Distance-hereditary comparability graphs
- Two remarks on circular arc graphs
- PC trees and circular-ones arrangements.
- Not complementary connected and not CIS \(d\)-graphs form weakly monotone families
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
- On algorithms for (\(P_5\), gem)-free graphs
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
- Efficient parameterized algorithms for computing all-pairs shortest paths
- Characterizations and algorithmic applications of chordal graph embeddings
- Rainbow generalizations of Ramsey theory: A survey
- The minimal non-\((\leqslant k)\)-reconstructible relations
- Interval decomposition lattices are balanced
- The half-isomorphy and the finite strongly connected tournaments
- On graphs associated to sets of rankings
- Applying modular decomposition to parameterized cluster editing problems
- Independent domination in finitely defined classes of graphs: polynomial algorithms
- String graphs and incomparability graphs
- Perfect graphs with no balanced skew-partition are 2-clique-colorable
- Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs
- Asteroidal triple-free graphs
- Simple DFS on the complement of a graph and on partially complemented digraphs
- Planar graphs and poset dimension
- On realizable biorders and the biorder dimension of a relation
- Bipartite permutation graphs
- Tree-width and dimension
- Partitive hypergraphs
- Holes and dominoes in Meyniel graphs
- A Representation Theorem for Union-Difference Families and Application
- The structure and metric dimension of the power graph of a finite group
- A survey of the algorithmic aspects of modular decomposition
- Metric dimension of bounded width graphs
- Vertex decomposable graphs and obstructions to shellability
- The pairs of \(\{-3\}\)-hypomorphic tournaments
- A supernodal formulation of vertex colouring with applications in course timetabling
- Modular decomposition and transitive orientation
- Extension of hereditary classes with substitutions
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- Metric Dimension of Bounded Tree-length Graphs
- On an edge partition and root graphs of some classes of line graphs
- On some graph classes related to perfect graphs: a survey
- On strict (outer-)confluent graphs
- Gallai-Ramsey number of an 8-cycle
- Order extensions and the fixed point property
- Gallai-Ramsey numbers involving a rainbow 4-path
- Set recognition of decomposable graphs and steps towards their reconstruction
- Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
- On graphs with limited number of \(P_{4}\)-partners
- Generalized complementation
- On box-perfect graphs
- 2-chains: An interesting family of posets
This page was built for publication: Transitiv orientierbare Graphen
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5534028)
