Covering a Strong Digraph by Α−1 Disjoint Paths: A Proof of Las Vergnas' Conjecture

Journal of Combinatorial Theory. Series B - United States
doi 10.1006/jctb.2001.2055
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Retraction: A Proof of the Strong Goldbach Conjecture

International Journal of Mathematical Education in Science and Technology
MathematicsApplied MathematicsEducation
2019English

A Direct Proof of AGT Conjecture at Β = 1

Journal of High Energy Physics
High Energy PhysicsNuclear
2011English

The Directed Geodetic Structure of a Strong Digraph

Czechoslovak Mathematical Journal
Mathematics
2004English

A Proof of Saffe's Conjecture

Fundamenta Mathematicae
Number TheoryAlgebra
1990English

Finding Two Disjoint Paths in a Network With Normalized Α + -MIN-SUM Objective Function

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Proof of a Conjecture of Kostant

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1987English

A Proof of the Pfister Factor Conjecture

Inventiones Mathematicae
Mathematics
2008English

A Blossom Algorithm for Maximum Edge-Disjoint T-Paths

2020English

Prime Producing Polynomials: Proof of a Conjecture by Mollin and Williams

Acta Arithmetica
Number TheoryAlgebra
1999English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy