scientific article
From MaRDI portal
Publication:2758332
zbMath0989.05050MaRDI QIDQ2758332
Frédéric Maffray, Myriam Preissmann
Publication date: 13 March 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)
Related Items
Permutation graphs and the weak Bruhat order ⋮ Labelled well-quasi-order for permutation classes ⋮ The \(\{-2,-1\}\)-selfdual and decomposable tournaments ⋮ Unnamed Item ⋮ Gallai-Ramsey numbers for a class of graphs with five vertices ⋮ From monomials to words to graphs. ⋮ 4-coloring \((P_6, \text{bull})\)-free graphs ⋮ A matrix description of weakly bipartitive and bipartitive families ⋮ Prime orders all of whose prime suborders are selfdual ⋮ Decomposition tree of a lexicographic product of binary structures ⋮ Birecognition of prime graphs, and minimal prime graphs ⋮ A characterization of \(P_{4}\)-comparability graphs ⋮ Indecomposability graph and indecomposability recognition ⋮ On opposition graphs, coalition graphs, and bipartite permutation graphs ⋮ The \(C_{3}\)-structure of the tournaments. ⋮ Recognition of prime graphs from a prime subgraph ⋮ Critically twin primitive 2-structures ⋮ Prime orientable graphs ⋮ Finite orders which are reconstructible up to duality by their comparability graphs ⋮ A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product ⋮ Transitive orientations in bull-reducible Berge graphs ⋮ Gallai colorings of non-complete graphs ⋮ The morphology of infinite tournaments; application to the growth of their profile ⋮ A finiteness theorem for primal extensions ⋮ The Erdős-Hajnal conjecture for rainbow triangles ⋮ Ultracritical and hypercritical binary structures ⋮ Connected colourings of complete graphs and hypergraphs ⋮ Editing to prime graphs ⋮ Extension of hereditary classes with substitutions ⋮ The recognition of the class of indecomposable digraphs under low hemimorphy ⋮ Letter graphs and modular decomposition ⋮ Unnamed Item ⋮ Counting Weighted Independent Sets beyond the Permanent ⋮ Lexicographic Orientation Algorithms ⋮ To reorient is easier than to orient: An on-line algorithm for reorientation of graphs ⋮ Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic ⋮ 3-uniform hypergraphs: modular decomposition and realization by tournaments ⋮ On algorithms for (\(P_5\), gem)-free graphs
This page was built for publication:
