Path Partitions, Cycle Covers and Integer Decomposition (Q3655152): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-02029-2_18 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2134291008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path partitions and packs of acyclic digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Greene-Kleitman's theorem for general digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-optimal partitions of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of Berge's strong path partition conjecture for \(k=2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diconnected Orientations and a Conjecture of Las Vergnas / rank
 
Normal rank
Property / cites work
 
Property / cites work: On k-optimum dipath partitions and partial k-colourings of acyclic digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coflow polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic orders: equivalence and duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal structures in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the orientation of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3283482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparability graphs and intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-edge intersection graphs of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of Sperner k-families / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Berge-keeping operation for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding coherent cyclic orders in strong digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wheels within wheels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the Greene-Kleitman theorem to directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nombre chromatique et plus longs chemins d'un graphe / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of the existence of k-saturated partitions of partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax relations for cyclically ordered digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank

Latest revision as of 08:51, 2 July 2024

scientific article
Language Label Description Also known as
English
Path Partitions, Cycle Covers and Integer Decomposition
scientific article

    Statements

    Path Partitions, Cycle Covers and Integer Decomposition (English)
    0 references
    0 references
    7 January 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references