Cites work
Cited in
(only showing first 100 items - show all)- On the complexity of cover-incomparability graphs of posets
- A finiteness theorem for primal extensions
- Order extensions and the fixed point property
- Prechains and self duality
- Distribution of colors in Gallai colorings
- Critically prime interval orders
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- A classification of edge-colored graphs based on properly colored walks
- Perfect couples of graphs
- Vertex deletion into bipartite permutation graphs
- Finite orders which are reconstructible up to duality by their comparability graphs
- Approximation of knapsack problems with conflict and forcing graphs
- A generalization of the theorem of Lekkerkerker and Boland
- Gallai-colorings of triples and 2-factors of \(\mathcal{B}_3\)
- Edge-disjoint properly colored cycles in edge-colored complete graphs
- Parameterized complexity for iterated type partitions and modular-width
- Ramsey and Gallai-Ramsey numbers for forests
- Gallai-Ramsey numbers for rainbow trees and monochromatic complete bipartite graphs
- Partial and simultaneous transitive orientations via modular decompositions
- The automorphism conjecture for ordered sets of dimension 2 and interval orders
- Edge-colored complete graphs containing no properly colored odd cycles
- A conjecture on Gallai-Ramsey numbers of even cycles and paths
- The Erdős–Gyárfás function with respect to Gallai‐colorings
- The Gallai and anti-Gallai graphs of strongly regular graphs
- 3-minimal triangle-free graphs
- Pairs of orthogonal countable ordinals
- Counting Gallai 3-colorings of complete graphs
- A characterization of \(P_{4}\)-comparability graphs
- Subgraphs of Gallai-colored complete graphs spanned by edges using at most two colors
- A survey of the studies on Gallai and anti-Gallai graphs
- Sources in posets and comparability graphs
- Gallai-Ramsey numbers of C₇ with multiple colors
- Comparability graphs among cover-incomparability graphs
- Odd cycle transversal on P₅-free graphs in polynomial time
- A distance measure for large graphs based on prime graphs
- Transitive orientations in bull-reducible Berge graphs
- Separator orders in interval, cocomparability, and AT-free graphs
- On an edge partition and root graphs of some classes of line graphs
- On connectivities of edge-colored graphs
- Recognizing indecomposability for tournaments
- Gallai and \(\ell \)-uniform Ramsey numbers of complete bipartite graphs
- Algorithms for finding an independent \(\{K_1,K_2\}\)-packing of maximum weight in a graph
- On the Weisfeiler-Leman dimension of permutation graphs
- On transitive orientations with restricted covering graphs
- Complete graphs and complete bipartite graphs without rainbow path
- Antimagicness of generalized corona and snowflake graphs
- On the problem of how to represent a graph taking into account an additional structure
- Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters
- Hereditary classes of ordered sets of width at most two
- Gallai-Ramsey numbers for graphs with chromatic number three
- Indecomposable graphs
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs
- Decomposition tree of a lexicographic product of binary structures
- Nash equilibria and values through modular partitions in infinite games
- Properly edge-colored theta graphs in edge-colored complete graphs
- Tree-representation of set families and applications to combinatorial decompositions
- Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
- Ramsey and Gallai-Ramsey numbers for the union of paths and stars
- Density of Gallai multigraphs
- A note on perfect graphs
- Obstructions to faster diameter computation: asteroidal sets
- On graphs associated to sets of rankings
- Gallai-Ramsey numbers for cycles
- Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
- Incremental construction of 2-structures
- Star-critical Gallai-Ramsey numbers of graphs
- Unique factorization of compositive hereditary graph properties
- Lexicographic orientation algorithms
- Forbidden graphs for classes of split-like graphs
- Cograph editing: Merging modules is equivalent to editing P₄s
- Invertibility of Digraphs and Tournaments
- On opposition graphs, coalition graphs, and bipartite permutation graphs
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- The Erdős-Hajnal conjecture for rainbow triangles
- Efficient parameterized algorithms for computing all-pairs shortest paths
- A Representation Theorem for Union-Difference Families and Application
- Random orders of dimension 2
- Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic
- On probe permutation graphs
- An efficient exact algorithm for triangle listing in large graphs
- Independent packings in structured graphs
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
- Bisplit graphs
- Monochromatic stars in rainbow \(K_3\)-free and \(S_3^+\)-free colorings
- Ramsey and Gallai-Ramsey number for wheels
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies
- Mortality of iterated Gallai graphs
- Noncommutative Schur functions for posets
- The 3-forced 2-structures
- Gallai-Ramsey numbers for three graphs on at most five vertices
- On strict (outer-)confluent graphs
- Some progress on the Aharoni-Korman conjecture
- Linkages in locally semicomplete digraphs and quasi-transitive digraphs
- Graph classes equivalent to 12-representable graphs
- On P₅-free locally split graphs
- Complete bipartite graphs without small rainbow subgraphs
- A recognition algorithm for simple-triangle 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)
