Transitiv orientierbare Graphen

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 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 ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ Gallai graphs and anti-Gallai graphs ⋮ A supernodal formulation of vertex colouring with applications in course timetabling ⋮ Hereditary unigraphs and Erdős-Gallai equalities ⋮ An antipode formula for the natural Hopf algebra of a set operad. ⋮ Generalized line graphs: Cartesian products and complexity of recognition ⋮ 3-minimal triangle-free graphs ⋮ Pairs of orthogonal countable ordinals ⋮ On the X-join decomposition for undirected graphs ⋮ Decomposition tree of a lexicographic product of binary structures ⋮ Nash equilibria and values through modular partitions in infinite games ⋮ Graph classes with and without powers of bounded clique-width ⋮ Tree-representation of set families and applications to combinatorial decompositions ⋮ Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs ⋮ Prechains and self duality ⋮ On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems ⋮ Commutative Schur rings over symmetric groups. ⋮ Algorithmic aspects of switch cographs ⋮ The pairs of \(\{-3\}\)-hypomorphic tournaments ⋮ On the hardness of recognizing triangular line graphs ⋮ Stacks and splits of partially ordered sets ⋮ Partitive hypergraphs ⋮ Partial characterizations of circle graphs ⋮ Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number ⋮ On prime inductive classes of graphs ⋮ A survey of the algorithmic aspects of modular decomposition ⋮ The structure and metric dimension of the power graph of a finite group ⋮ On the complexity of dynamic programming for sequencing problems with precedence constraints ⋮ On structural descriptions of lower ideals of series parallel posets ⋮ Practical and efficient split decomposition via graph-labelled trees ⋮ Forests and trees among Gallai graphs ⋮ Properly edge-coloured subgraphs in colourings of bounded degree ⋮ Random orders of dimension 2 ⋮ On graphs associated to sets of rankings ⋮ Edge-colorings avoiding rainbow and monochromatic subgraphs ⋮ Critically twin primitive 2-structures ⋮ Characterization and complexity of uniformly nonprimitive labeled 2-structures ⋮ Two remarks on circular arc graphs ⋮ Two complexity results for the vertex coloring problem ⋮ Approximate association via dissociation ⋮ Colored graphs without colorful cycles ⋮ \((\leqslant k)\)-half-reconstructible tournaments for \(k\leqslant 6\) ⋮ Order extensions and the fixed point property ⋮ Perfect couples of graphs ⋮ Sources in posets and comparability graphs ⋮ \(P_ 4\)-trees and substitution decomposition ⋮ 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 ⋮ Gallai colorings of non-complete graphs ⋮ Not complementary connected and not CIS \(d\)-graphs form weakly monotone families ⋮ The morphology of infinite tournaments; application to the growth of their profile ⋮ On sources in comparability graphs, with applications ⋮ On probe permutation graphs ⋮ Decomposing complete edge-chromatic graphs and hypergraphs. Revisited ⋮ Gallai-Ramsey numbers for cycles ⋮ The half-isomorphy and the finite strongly connected tournaments ⋮ \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth ⋮ Comparability graphs and a new matroid ⋮ Inversions in tournaments ⋮ Characterization problems for graphs, partially ordered sets, lattices, and families of sets ⋮ Proof of Ding's conjecture on maximal stable sets and maximal cliques in planar graphs ⋮ Clique-width of graphs defined by one-vertex extensions ⋮ Critically prime interval orders ⋮ Solving partition problems with colour-bipartitions ⋮ The recognition of the class of indecomposable digraphs under low hemimorphy ⋮ Algorithmic aspects of a general modular decomposition theory ⋮ Dimension preserving contractions and a finite list of 3-irreducible posets ⋮ 2-chains: An interesting family of posets ⋮ The number of Gallai \(k\)-colorings of complete graphs ⋮ Vertex- and edge-minimal and locally minimal graphs ⋮ On minimal prime graphs and posets ⋮ Remarks on the distribution of colors in Gallai colorings ⋮ On realizable biorders and the biorder dimension of a relation ⋮ On the number of k-realizations of an ordered set ⋮ Interval dimension is a comparability invariant ⋮ Comparability graphs with constraint, partial semi-orders and interval orders ⋮ Generalized complementation ⋮ On algorithms for (\(P_5\), gem)-free graphs

Cites Work

This page was built for publication: Transitiv orientierbare Graphen