scientific article
From MaRDI portal
Publication:3291037
zbMath0105.35503MaRDI QIDQ3291037
Publication date: 1962
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (66)
Alternating orientation and alternating colouration of perfect graphs ⋮ Flots et tensions dans un graphe ⋮ Vertex heaviest paths and cycles in quasi-transitive digraphs ⋮ Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments ⋮ Is there a diagram invariant? ⋮ Balanced Cohen-Macaulay Complexes ⋮ Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs ⋮ \(P_ 4\)-comparability graphs ⋮ \(k\)-quasi-transitive digraphs of large diameter ⋮ A recognition algorithm for simple-triangle graphs ⋮ Shattering, graph orientations, and connectivity ⋮ k‐quasi‐transitive digraphs of large diameter ⋮ MPQ-trees for the orthogonal packing problem ⋮ Richardson's theorem in quasi-transitive and pre-transitive digraphs ⋮ Necessary and possible indifferences ⋮ Chromatic polynomials of 2-edge-coloured graphs ⋮ Decomposing random mechanisms ⋮ Independent sets and non-augmentable paths in generalizations of tournaments ⋮ Graphs Orientable as Distributive Lattices ⋮ Characterizations of graphs having orientations satisfying local degree restrictions ⋮ A structure theory for ordered sets ⋮ A characterization of \(P_{4}\)-comparability graphs ⋮ \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs ⋮ On the complexity of recognizing perfectly orderable graphs ⋮ The structure and metric dimension of the power graph of a finite group ⋮ The \(C_{3}\)-structure of the tournaments. ⋮ Some remarks on the structure of strong \(k\)-transitive digraphs ⋮ \(H\)-kernels in unions of \(H\)-colored quasi-transitive digraphs ⋮ A condition for a family of triangles to be orientable to a cyclic order ⋮ Restricted domination in quasi-transitive and 3-quasi-transitive digraphs ⋮ On graphs associated to sets of rankings ⋮ Prime orientable graphs ⋮ A note on chordal bound graphs and posets ⋮ Recent results on containment graphs of paths in a tree ⋮ Counterexamples to three conjectures concerning perfect graphs ⋮ On the SPANNING \(k\)-TREE problem ⋮ Distance-hereditary comparability graphs ⋮ Kernels by monochromatic paths in \(m\)-colored unions of quasi-transitive digraphs ⋮ On the structure of strong 3-quasi-transitive digraphs ⋮ Kernels in quasi-transitive digraphs ⋮ Comparability graphs and a new matroid ⋮ 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 ⋮ The complexity of comparability graph recognition and coloring ⋮ On the existence of \((k,l)\)-kernels in infinite digraphs: a survey ⋮ On \(k\)-tree containment graphs of paths in a tree ⋮ On a class of posets and the corresponding comparability graphs ⋮ Graphs and partial orderings ⋮ Dimensions of hypergraphs ⋮ Some sufficient conditions for the existence of kernels in infinite digraphs ⋮ Concordance graphs ⋮ Distance-Hereditary Comparability Graphs ⋮ Maximal dimensional partially ordered sets. II: Characterization of 2n- element posets with dimension n ⋮ Chromatic polynomials of oriented graphs ⋮ Weakly Hamiltonian-connected ordinary multipartite tournaments ⋮ Linkages in locally semicomplete digraphs and quasi-transitive digraphs ⋮ Quasi-Transitive Digraphs and Their Extensions ⋮ Lexicographic Orientation Algorithms ⋮ Kings in quasi-transitive digraphs ⋮ Modular decomposition and transitive orientation ⋮ To reorient is easier than to orient: An on-line algorithm for reorientation of graphs ⋮ The Dimension of a Comparability Graph ⋮ Comparability graphs with constraint, partial semi-orders and interval orders ⋮ Transitiv orientierbare Graphen ⋮ Posets with large dimension and relatively few critical pairs ⋮ 3-uniform hypergraphs: modular decomposition and realization by tournaments
This page was built for publication:
