Transitiv orientierbare Graphen
From MaRDI portal
Publication:5534028
DOI10.1007/BF02020961zbMath0153.26002WikidataQ57535765 ScholiaQ57535765MaRDI QIDQ5534028
No author found.
Publication date: 1967
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
A conjecture on Gallai-Ramsey numbers of even cycles and paths ⋮ Destroying Bicolored $P_3$s by Deleting Few Edges ⋮ Iterated Type Partitions ⋮ Labelled well-quasi-order for permutation classes ⋮ Testing superperfection of k-trees ⋮ Hierarchical and modularly-minimal vertex colorings ⋮ An Analytic Propositional Proof System on Graphs ⋮ Gallai-Ramsey numbers of $C_{10}$ and $C_{12}$ ⋮ Gallai-Ramsey numbers for graphs with five vertices of chromatic number four ⋮ Unnamed Item ⋮ On Strict (Outer-)Confluent Graphs ⋮ Combining decomposition approaches for the maximum weight stable set problem ⋮ Gallai-Ramsey numbers involving a rainbow 4-path ⋮ MaxCut on permutation graphs is NP‐complete ⋮ Properly colored cycles of different lengths in edge-colored complete graphs ⋮ Edge‐colored complete graphs without properly colored even cycles: A full characterization ⋮ Gallai–Ramsey number for K5 ${K}_{5}$ ⋮ The multicolor star-critical Gallai-Ramsey number for a path of order 5 ⋮ Efficient parameterized algorithms for computing all-pairs shortest paths ⋮ The Erdős–Gyárfás function with respect to Gallai‐colorings ⋮ Complete bipartite graphs without small rainbow stars ⋮ Comparability graphs among cover-incomparability graphs ⋮ Birecognition of prime graphs, and minimal prime graphs ⋮ Edge-disjoint properly colored cycles in edge-colored complete graphs ⋮ Parameterized complexity for iterated type partitions and modular-width ⋮ Partial and simultaneous transitive orientations via modular decompositions ⋮ Invertibility of Digraphs and Tournaments ⋮ Size Gallai-Ramsey number ⋮ Asteroidal triple-free graphs ⋮ Complete bipartite graphs without small rainbow subgraphs ⋮ Comparability digraphs: an analogue of comparability graphs ⋮ Gallai-Ramsey numbers for 3-uniform rainbow Berge triangles and monochromatic linear paths or cycles ⋮ Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs ⋮ Decomposition of infinite labeled 2-structures ⋮ On new algorithmic techniques for the weighted vertex coloring problem ⋮ Algorithms and complexity of sandwich problems in graphs (extended abstract) ⋮ \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs ⋮ Strong Cocomparability Graphs and Slash-Free Orderings of Matrices ⋮ Easily Testable Graph Properties ⋮ Cograph editing: Merging modules is equivalent to editing P_4s ⋮ Bipartite Analogues of Comparability and Cocomparability Graphs ⋮ Unnamed Item ⋮ String graphs and incomparability graphs ⋮ Dynamic Distance Hereditary Graphs Using Split Decomposition ⋮ EULERIAN AND HAMILTONIAN PROPERTIES OF GALLAI AND ANTI-GALLAI TOTAL GRAPHS ⋮ The simplicity index of tournaments ⋮ Unnamed Item ⋮ Efficient and Adaptive Parameterized Algorithms on Modular Decompositions ⋮ A polynomial algorithm to find an independent set of maximum weight in a fork-free graph ⋮ A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product ⋮ Graphs defined on groups ⋮ Domination graphs: Examples and counterexamples ⋮ Unnamed Item ⋮ Nesting of prime substructures in \(k-\)ary relations ⋮ Vertex deletion into bipartite permutation graphs ⋮ Constructive Methods in Gallai-Ramsey Theory for Hypergraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs ⋮ A short note on undirected Fitch graphs ⋮ Fully dynamic algorithm for recognition and modular decomposition of permutation graphs ⋮ The Typical Structure of Gallai Colorings and Their Extremal Graphs ⋮ Connected colourings of complete graphs and hypergraphs ⋮ Graph isomorphism restricted by lists ⋮ Your rugby mates don't need to know your colleagues: triadic closure with edge colors ⋮ A Representation Theorem for Union-Difference Families and Application ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters ⋮ Counting Weighted Independent Sets beyond the Permanent ⋮ ON GRAPHS WITH LIMITED NUMBER OF P4-PARTNERS ⋮ HOLES AND DOMINOES IN MEYNIEL GRAPHS ⋮ On an edge partition and root graphs of some classes of line graphs ⋮ Graph Classes and Forbidden Patterns on Three Vertices ⋮ Gallai-Ramsey number of an 8-cycle ⋮ To reorient is easier than to orient: An on-line algorithm for reorientation of graphs ⋮ Linear-time recognition of double-threshold graphs ⋮ Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic ⋮ Metric Dimension of Bounded Tree-length Graphs ⋮ A combinatorial bijection between linear extensions of equivalent orders ⋮ Unique factorization of compositive hereditary graph properties ⋮ 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 complexity of cover-incomparability graphs of posets ⋮ Interval decomposition lattices are balanced ⋮ On transitive orientations with restricted covering graphs ⋮ Simple DFS on the complement of a graph and on partially complemented digraphs ⋮ On the problem of how to represent a graph taking into account an additional structure ⋮ Indecomposable tournaments and their indecomposable subtournaments on 5 vertices ⋮ Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\) ⋮ Two classes of perfect graphs ⋮ Is there a diagram invariant? ⋮ Reconstructibility and perfect graphs ⋮ Recognizing claw-free perfect graphs ⋮ Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs ⋮ Planar graphs and poset dimension ⋮ Recognizing graphs without asteroidal triples ⋮ Prime orders all of whose prime suborders are selfdual
Cites Work
This page was built for publication: Transitiv orientierbare Graphen
