scientific article
From MaRDI portal
Publication:3283482
zbMath0101.16608MaRDI QIDQ3283482
Publication date: 1960
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On k-optimum dipath partitions and partial k-colourings of acyclic digraphs ⋮ On the Complexity of Singly Connected Vertex Deletion ⋮ Weighted Rooted Trees: Fat or Tall? ⋮ Linial's conjecture for arc-spine digraphs ⋮ A proof of Dilworth's decomposition theorem for partially ordered sets ⋮ Proof of Berge's path partition conjecture for \(k \geq \lambda - 3\) ⋮ \( \chi \)-diperfect digraphs ⋮ Searching for acyclic orientations of graphs ⋮ Motivations and history of some of my conjectures ⋮ A note on the edge-reconstruction of \(K_{1,m}\)-free graphs ⋮ A short proof of the Chen-Manalastas theorem ⋮ Switchdec polyhedra ⋮ Variations on the Gallai-Milgram theorem ⋮ Extremal \(k\)-forcing sets in oriented graphs ⋮ A family of counterexamples for a conjecture of Berge on \(\alpha\)-diperfect digraphs ⋮ On the path partition number of 6‐regular graphs ⋮ Ramsey-type results for path covers and path partitions. II: Digraphs ⋮ Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number ⋮ On \(\chi \)-diperfect digraphs with stability number two ⋮ Directed domination in oriented graphs ⋮ Berge's conjecture on directed path partitions -- a survey ⋮ Extending the Greene-Kleitman theorem to directed graphs ⋮ A note concerning paths and independence number in digraphs ⋮ Counting restricted orientations of random graphs ⋮ k-optimal partitions of a directed graph ⋮ Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach ⋮ On covering vertices of a graph by trees ⋮ Proof of Berge's strong path partition conjecture for \(k=2\) ⋮ Trestles in the squares of graphs ⋮ On the strong and the semi-strong path partition conjecture ⋮ Gallai-Milgram properties for infinite graphs ⋮ Shortcutting directed and undirected networks with a degree constraint ⋮ Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture ⋮ On Linial's conjecture for spine digraphs ⋮ Coflow polyhedra ⋮ A unified approach to known and unknown cases of Berge's conjecture ⋮ On the strong path partition conjecture of Berge ⋮ On Greene-Kleitman's theorem for general digraphs ⋮ Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs ⋮ On the Berge's strong path partition conjecture ⋮ Sur les arborescences dans un graphe oriente ⋮ On switching paths polyhedra ⋮ On the existence of k-separated finite and infinite dipaths ⋮ Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey ⋮ On a class of posets and the corresponding comparability graphs ⋮ Covering digraphs by paths ⋮ Systems of representatives ⋮ Hajós and Ore constructions for digraphs ⋮ Antidirected Hamiltonian paths in tournaments ⋮ Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number ⋮ On Path Partitions and Colourings in Digraphs ⋮ Path Partitions, Cycle Covers and Integer Decomposition ⋮ Diperfect graphs ⋮ Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers ⋮ Basic Terminology, Notation and Results ⋮ Digraphs Products ⋮ On the complexity of singly connected vertex deletion ⋮ Sufficient Conditions for a Digraph to be Supereulerian ⋮ Some Ramsey nu mbers for directed graphs ⋮ Submodular functions and rooted trees ⋮ Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture ⋮ \(\alpha\)-diperfect digraphs
