The following pages link to (Q3283482):
Displaying 50 items.
- Proof of Berge's path partition conjecture for \(k \geq \lambda - 3\) (Q298972) (← links)
- Directed domination in oriented graphs (Q423913) (← links)
- Shortcutting directed and undirected networks with a degree constraint (Q507583) (← links)
- On Linial's conjecture for spine digraphs (Q512554) (← links)
- On switching paths polyhedra (Q579630) (← links)
- On the strong path partition conjecture of Berge (Q686176) (← links)
- On Greene-Kleitman's theorem for general digraphs (Q687099) (← links)
- A note concerning paths and independence number in digraphs (Q913811) (← links)
- Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach (Q941336) (← links)
- On covering vertices of a graph by trees (Q941380) (← links)
- Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture (Q949757) (← links)
- On k-optimum dipath partitions and partial k-colourings of acyclic digraphs (Q1082350) (← links)
- A note on the edge-reconstruction of \(K_{1,m}\)-free graphs (Q1102982) (← links)
- Variations on the Gallai-Milgram theorem (Q1112833) (← links)
- Extending the Greene-Kleitman theorem to directed graphs (Q1155625) (← links)
- k-optimal partitions of a directed graph (Q1172068) (← links)
- Gallai-Milgram properties for infinite graphs (Q1191912) (← links)
- Coflow polyhedra (Q1197009) (← links)
- On the Berge's strong path partition conjecture (Q1210577) (← links)
- Sur les arborescences dans un graphe oriente (Q1229222) (← links)
- On the existence of k-separated finite and infinite dipaths (Q1235181) (← links)
- On a class of posets and the corresponding comparability graphs (Q1247984) (← links)
- Covering digraphs by paths (Q1250116) (← links)
- Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers (Q1297441) (← links)
- Motivations and history of some of my conjectures (Q1356729) (← links)
- Switchdec polyhedra (Q1363748) (← links)
- Diperfect graphs (Q1838975) (← links)
- Some Ramsey nu mbers for directed graphs (Q1846431) (← links)
- Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture (Q1850573) (← links)
- Searching for acyclic orientations of graphs (Q1898338) (← links)
- A short proof of the Chen-Manalastas theorem (Q1903737) (← links)
- Trestles in the squares of graphs (Q1981662) (← links)
- On the strong and the semi-strong path partition conjecture (Q1985941) (← links)
- Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs (Q2000583) (← links)
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- Submodular functions and rooted trees (Q2095463) (← links)
- \(\alpha\)-diperfect digraphs (Q2113335) (← links)
- Linial's conjecture for arc-spine digraphs (Q2132415) (← links)
- \( \chi \)-diperfect digraphs (Q2144488) (← links)
- Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey (Q2277468) (← links)
- Hajós and Ore constructions for digraphs (Q2309234) (← links)
- Extremal \(k\)-forcing sets in oriented graphs (Q2416417) (← links)
- Berge's conjecture on directed path partitions -- a survey (Q2433711) (← links)
- Proof of Berge's strong path partition conjecture for \(k=2\) (Q2462329) (← links)
- A proof of Dilworth's decomposition theorem for partially ordered sets (Q2625477) (← links)
- Basic Terminology, Notation and Results (Q3120433) (← links)
- Digraphs Products (Q3120442) (← links)
- On Path Partitions and Colourings in Digraphs (Q3655147) (← links)
- Path Partitions, Cycle Covers and Integer Decomposition (Q3655152) (← links)
- A unified approach to known and unknown cases of Berge's conjecture (Q4650184) (← links)
