Publications of Stéphane Bessy
BACK TO COATI PUBLICATION INDEX
Publications of Stéphane Bessy
-
Jorgen Bang-Jensen,
Stéphane Bessy,
Frédéric Havet,
and Anders Yeo.
Bipartite spanning sub(di)graphs induced by 2-partitions.
Journal of Graph Theory,
92(2):130-151,
October 2019.
[WWW
] [PDF
]
Keywords:
Eulerian,
Spanning bipartite subdigraph,
Strong spanning subdigraph,
2-partition,
Minimum out-degree.
[bibtex-entry]
-
Joergen Bang-Jensen,
Stéphane Bessy,
Frédéric Havet,
and Anders Yeo.
Out-degree reducing partitions of digraphs.
Theoretical Computer Science,
719:64-72,
April 2018.
[WWW
] [PDF
]
Keywords:
Polynomial algorithm,
2-partition,
Maximum out-degree reducing partition,
NP-complete.
[bibtex-entry]
-
S. Bessy and F. Havet.
Enumerating the edge-colourings and total colourings of a regular graph.
Journal of Combinatorial Optimization,
25(4):523-535,
2013.
[WWW
] [bibtex-entry]
-
S. Bessy,
E. Birmelé,
and F. Havet.
Arc-chromatic number of digraphs in which each vertex has bounded outdegree or bounded indegree.
Journal of Graph Theory,
53(4):315--332,
2006.
[WWW
] [PDF
] [bibtex-entry]
-
S. Bessy,
N. Lichiardopol,
and J.-S. Sereni.
Two proofs of Bermond-Thomassen conjecture for regular tournaments.
In Proceedings of the sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications,
volume 28 of Electronic Notes in Discrete Mathematics,
pages 47--53,
2007.
Elsevier.
[WWW
] [PDF
] [bibtex-entry]
-
S. Bessy and S. Thomassé.
Three min-max theorems concerning cyclic orders of strong digraphs.
In Acts of IPCO X 2004,
volume 3064 of Lecture Notes in Computer Sciences,
pages 132--138,
2004.
Springer-Verlag.
[WWW
] [bibtex-entry]
-
S. Bessy.
Un algorithme d'approximation pour le sous-digraphe fortement connexe minimal.
In Sixièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'04),
pages 57--61,
2004.
INRIA.
[WWW
] [bibtex-entry]
-
S. Bessy and F. Havet.
Enumerating the edge-colourings and total colourings of a regular graph.
Research Report RR-7652,
INRIA,
June 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
S. Bessy,
E. Birmelé,
and F. Havet.
Arc-chromatic number of digraphs in which each vertex has bounded outdegree or bounded indegree.
Research Report RR-5364,
INRIA,
2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis,
November 2004.
[WWW
] [PDF
] [POSTSCRIPT
] [bibtex-entry]
-
S. Bessy,
F. Havet,
and J. Palaysi.
Pancyclic Arcs and Connectivity in Tournaments.
Rapport de recherche INRIA/RR-4522,
Projet MASCOTTE,
Sophia Antipolis,
August 2002.
[bibtex-entry]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:43 2022
