scientific article; zbMATH DE number 3150485
From MaRDI portal
Publication:3267901
zbMATH Open0092.15801MaRDI QIDQ3267901FDOQ3267901
Authors: Paul Camion 
Publication date: 1959
Title of this publication is not available (Why is that?)
Cited In (89)
- A remark on cycles through an arc in strongly connected multipartite tournaments
- Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs
- Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach
- Path Partitions, Cycle Covers and Integer Decomposition
- Cycle factors in strongly connected local tournaments
- Parameterized complexity of \(d\)-hitting set with quotas
- The iterated local transitivity model for tournaments
- Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
- Regular Hypertournaments and Arc-Pancyclicity
- Title not available (Why is that?)
- Cycles in bipartite tournaments
- Cycles with a given number of vertices from each partite set in regular multipartite tournaments
- Dicycle cover of Hamiltonian oriented graphs
- Cycles through arcs in multipartite tournaments and a conjecture of Volkmann
- On multipartite tournaments
- Out-arc pancyclicity of vertices in tournaments
- The number of out-pancyclic vertices in a strong tournament
- An \(s\)-strong tournament with \(s\geq 3\) has \(s+1\) vertices whose out-arcs are 4-pancyclic
- Each 3-strong tournament contains 3 vertices whose out-arcs are pancyclic
- Non-separating spanning trees and out-branchings in digraphs of independence number 2
- Berge's conjecture on directed path partitions -- a survey
- Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
- On arc-traceable local tournaments
- Stable set meeting every longest path
- Cycles and paths in bipartite tournaments with spanning configurations
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs
- Oriented Hamiltonian cycles in tournaments
- Vertex 6-pancyclic in-tournaments
- On disjoint cycles of the same length in tournaments
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs
- Lichiardopol's conjecture on disjoint cycles in tournaments
- Multipartite tournaments: a survey
- On pancyclic arcs in hypertournaments
- A survey on Hamilton cycles in directed graphs
- Cycles of each length in tournaments
- Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
- Complementary cycles of any length in regular bipartite tournaments
- The number of vertices whose out-arcs are pancyclic in a 2-strong tournament
- Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
- Diperfect graphs
- Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture
- Tournaments and Semicomplete Digraphs
- Disjoint cycles of different lengths in graphs and digraphs
- On a cyclic connectivity property of directed graphs
- Semicomplete Multipartite Digraphs
- Spanning eulerian subdigraphs in semicomplete digraphs
- Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments
- Hamiltonian dicycles avoiding prescribed arcs in tournaments
- A linear-time algorithm for finding Hamiltonian cycles in tournaments
- Sublinear-time algorithms for tournament graphs
- Hamiltonian tournaments and Gorenstein rings
- Shortcutting directed and undirected networks with a degree constraint
- Title not available (Why is that?)
- Arc-pancyclicity of hypertournaments with irregularity at most two
- On cycles through a given vertex in multipartite tournaments
- Degrees and cycles in digraphs
- On the spanning connectivity of tournaments
- Bypaths in tournaments
- Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments
- Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture
- About the number of oriented Hamiltonian paths and cycles in tournaments
- On the vertex-pancyclicity of hypertournaments
- Variations on the Gallai-Milgram theorem
- Surjective \texttt{H}-colouring over reflexive digraphs
- Paths with a given number of vertices from each partite set in regular multipartite tournaments
- Notes on weak-odd edge colorings of digraphs
- Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in-tournaments
- \(\alpha\)-diperfect digraphs
- Vertex degree sums for supereulerian bipartite digraphs
- Positive vectors, pairwise comparison matrices and directed Hamiltonian cycles
- The watchman's walk problem on directed graphs
- Polynomial stability and potentially stable patterns
- A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs
- A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs
- Cycles in a tournament with pairwise zero, one or two given vertices in common
- Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties
- The energy of the alphabet model
- All 2-connected in-tournaments that are cycle complementary
- Trail-connected tournaments
- Spanning 3-strong tournaments in 5-strong semicomplete digraphs
- Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs
- Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs
- The structure of 4-strong tournaments containing exactly three out-arc pancyclic vertices
- Hamiltonian cycles avoiding prescribed arcs in semicomplete digraphs
- Two‐stage majoritarian choice
- Packing strong subgraph in digraphs
- On 1-factors with prescribed lengths in tournaments
- About the number of directed paths in tournaments
- Sublinear-Time Algorithms for Tournament Graphs
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 Q3267901)
