scientific article; zbMATH DE number 3165195

Cited in

(75)

On k-optimum dipath partitions and partial k-colourings of acyclic digraphs
A note on the edge-reconstruction of \(K_{1,m}\)-free graphs
Variations on the Gallai-Milgram theorem
Extending the Greene-Kleitman theorem to directed graphs
k-optimal partitions of a directed graph
Gallai-Milgram properties for infinite graphs
Coflow polyhedra
On the Berge's strong path partition conjecture
Sur les arborescences dans un graphe oriente
On the existence of k-separated finite and infinite dipaths
On a class of posets and the corresponding comparability graphs
Covering digraphs by paths
Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers
Motivations and history of some of my conjectures
Switchdec polyhedra
Diperfect graphs
Some Ramsey nu mbers for directed graphs
Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture
Searching for acyclic orientations of graphs
A short proof of the Chen-Manalastas theorem
Trestles in the squares of graphs
On the strong and the semi-strong path partition conjecture
Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs
On the complexity of singly connected vertex deletion
Submodular functions and rooted trees
\(\alpha\)-diperfect digraphs
Linial's conjecture for arc-spine digraphs
\( \chi \)-diperfect digraphs
Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
Hajós and Ore constructions for digraphs
Extremal k-forcing sets in oriented graphs
Berge's conjecture on directed path partitions -- a survey
Proof of Berge's strong path partition conjecture for \(k=2\)
A proof of Dilworth's decomposition theorem for partially ordered sets
Proof of Berge's path partition conjecture for \(k \geq \lambda - 3\)
Basic Terminology, Notation and Results
Digraphs products
On path partitions and colourings in digraphs
Path Partitions, Cycle Covers and Integer Decomposition
Directed domination in oriented graphs
A unified approach to known and unknown cases of Berge's conjecture
On the Complexity of Singly Connected Vertex Deletion
Weighted Rooted Trees: Fat or Tall?
Shortcutting directed and undirected networks with a degree constraint
Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
On Linial's conjecture for spine digraphs
Counting restricted orientations of random graphs
Sufficient conditions for a digraph to be supereulerian
On switching paths polyhedra
Systems of representatives
Antidirected Hamiltonian paths in tournaments
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 -diperfect digraphs with stability number two
BE-diperfect digraphs with stability number two
A Hall-type condition for path covers in bipartite graphs
Secant edges: a tool for Cohen et al.'s conjectures about subdivisions of oriented cycles and bispindles in Hamiltonian digraphs with large chromatic number
Parameterizing path partitions
On the strong path partition conjecture of Berge
On Greene-Kleitman's theorem for general digraphs
Acyclic subgraphs of digraphs with high chromatic number
Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order
Distance-based (and path-based) covering problems for graphs of given cyclomatic number
Cycle partitions in dense regular digraphs and oriented graphs
Towards transitive-free digraphs
Cycle partition of dense regular digraphs and oriented graphs (extended abstract)
A new perspective from hypertournaments to tournaments
Pancyclicity of Hamiltonian graphs
Isometric and induced path partitions: a new upper bound and a characterization of some extremal graphs
A note concerning paths and independence number in digraphs
Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach
On covering vertices of a graph by trees
Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3283482)