Transitiv orientierbare Graphen
From MaRDI portal
Cites work
Cited in
(only showing first 100 items - show all)- The recognition of the class of indecomposable digraphs under low hemimorphy
- Algorithmic aspects of a general modular decomposition theory
- Vertex- and edge-minimal and locally minimal graphs
- On minimal prime graphs and posets
- On realizable biorders and the biorder dimension of a relation
- Comparability graphs with constraint, partial semi-orders and interval orders
- Generalized complementation
- A combinatorial bijection between linear extensions of equivalent orders
- A note on perfect graphs
- Alternating orientation and alternating colouration of perfect graphs
- On finding the jump number of a partial order by substitution decomposition
- Bipartite permutation graphs
- On the problem of how to represent a graph taking into account an additional structure
- Two classes of perfect graphs
- Is there a diagram invariant?
- Recognizing claw-free perfect graphs
- Planar graphs and poset dimension
- Gallai graphs and anti-Gallai graphs
- On the X-join decomposition for undirected graphs
- Stacks and splits of partially ordered sets
- Partitive hypergraphs
- Random orders of dimension 2
- Perfect couples of graphs
- \(P_ 4\)-trees and substitution decomposition
- On sources in comparability graphs, with applications
- Comparability graphs and a new matroid
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- The complexity of comparability graph recognition and coloring
- Clumps, minimal asymmetric graphs, and involutions
- Construction of a simple elimination scheme for a chordal comparability graph in linear time
- On minimal imperfect graphs without induced P₅
- Linkages in locally semicomplete digraphs and quasi-transitive digraphs
- Forbidden induced partial orders
- Modular decomposition and transitive orientation
- Order series of labelled posets
- Mortality of iterated Gallai graphs
- Incremental construction of 2-structures
- A k-structure generalization of the theory of 2-structures
- \(P_{4}\)-laden graphs: A new class of brittle graphs
- On semi-\(P_ 4\)-sparse graphs
- Scattering number and modular decomposition
- Indecomposable graphs
- Treewidth for graphs with small chordality
- Characterizations and algorithmic applications of chordal graph embeddings
- On \(\text{CC}\)-comparability invariance of the fixed point property
- On extended P₄-reducible and extended P₄-sparse graphs
- PC trees and circular-ones arrangements.
- Induced matchings in asteroidal triple-free graphs
- Weak order polytopes.
- Hereditary dominating pair graphs
- Split orders
- The \(C_{3}\)-structure of the tournaments.
- Sur la répartition des diamants dans un tournoi. (On the repartition of diamonds in a tournament).
- Induced matchings in intersection graphs.
- Reconstruction of posets with the same comparability graph
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters
- The \(\{-2,-1\}\)-selfdual and decomposable tournaments
- On box-perfect graphs
- A graph isomorphism condition and equivalence of reaction systems
- Trees and circle orders
- Necessary and possible indifferences
- \(\mathcal{P}\)-apex graphs
- The \((\leq 5)\)-hypomorphy of digraphs up to complementation
- All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs
- Gallai-Ramsey numbers of C₇ with multiple colors
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs
- Properly edge-colored theta graphs in edge-colored complete graphs
- An efficient exact algorithm for triangle listing in large graphs
- Recent results on containment graphs of paths in a tree
- Monochromatic subgraphs in the absence of a properly colored 4-cycle
- Gallai-Ramsey numbers of odd cycles and complete bipartite graphs
- Gallai-Ramsey numbers for monochromatic triangles or 4-cycles
- A counterexample regarding labelled well-quasi-ordering
- Distance-hereditary comparability graphs
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- A simple linear time algorithm for cograph recognition
- Linear-time modular decomposition of directed graphs
- The minimal non-( k)-reconstructible relations
- What is reconstruction for ordered sets?
- Parameterized algorithms for conflict-free colorings of graphs
- Interval \(k\)-graphs and orders
- Graphic topology on tournaments
- A vertex ordering characterization of simple-triangle graphs
- Extension of hereditary classes with substitutions
- Invariants of finite comparability graphs
- La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
- On-line algorithms for ordered sets and comparability graphs
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures
- On the \(P_4\)-components of graphs
- Worpitzky-compatible subarrangements of braid arrangements and cocomparability graphs
- Extremal problems and results related to Gallai-colorings
- Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result
- Distribution of colors in Gallai colorings
- Finite orders which are reconstructible up to duality by their comparability graphs
- Monochromatic stars in rainbow \(K_3\)-free and \(S_3^+\)-free colorings
- Approximation of knapsack problems with conflict and forcing graphs
- Antimagicness of generalized corona and snowflake graphs
- Gallai-Ramsey numbers for multiple triangles
- Gallai and \(\ell \)-uniform Ramsey numbers of complete bipartite graphs
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)
