, |U ? (v)| ? q for every v ? V (G)
, At least one of U ? (v), U ? (w) is empty for each fragile edge vw
, x ? B belong to distinct bad edges, then ({w} ? U + (w)) ? ({x} ? U + (x)) = ?
, Clearly, |U ? (v)| ? q for every v ? V (G) the first time the condition of the while loop is being tested. This remains true for every subsequent test Bibliography
, Subdivisions in digraphs of large out-degree or large dichromatic number, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01403921
Oriented trees in digraphs, Discrete Mathematics, vol.313, issue.8, pp.967-974, 2013. ,
DOI : 10.1016/j.disc.2013.01.011
URL : https://hal.archives-ouvertes.fr/inria-00551133
Paths with two blocks in n-chromatic digraphs, Journal of Combinatorial Theory, Series B, vol.97, issue.4, pp.620-626, 2007. ,
DOI : 10.1016/j.jctb.2006.10.001
URL : https://hal.archives-ouvertes.fr/inria-00070325
Disjoint directed cycles, Journal of Combinatorial Theory, Series B, vol.68, issue.2, pp.167-178, 1996. ,
DOI : 10.1006/jctb.1996.0062
URL : https://doi.org/10.1006/jctb.1996.0062
Dominating sets in k-majority tournaments, Journal of Combinatorial Theory, Series B, vol.96, issue.3, pp.374-387, 2006. ,
DOI : 10.1016/j.jctb.2005.09.003
URL : https://doi.org/10.1016/j.jctb.2005.09.003
Adjacent vertex distinguishing edge-colorings, SIAM J. Discrete Math, vol.21, issue.1, pp.237-250, 2007. ,
DOI : 10.1137/s0895480102414107
Tournaments and colouring, Journal of Combinatorial Theory, Series B, vol.103, issue.1, pp.1-20, 2013. ,
DOI : 10.1016/j.jctb.2012.08.003
URL : https://doi.org/10.1016/j.jctb.2012.08.003
Proof of a conjecture of Mader, Erd? os and Hajnal on topological complete subgraphs, Eur. J. Comb, vol.19, pp.883-887, 1998. ,
Disconnected orientations and a conjecture of Las Vergnas, J. London Math. Soc, vol.14, 1976. ,
DOI : 10.1112/jlms/s2-14.2.277
A proof of the Erd? os-Sands-Sauer-Woodrow conjecture, 2017. ,
Covering with euclidean boxes, European Journal of Combinatorics, vol.8, issue.2, pp.113-119, 1987. ,
On colouring the nodes of a network, Mathematical Proceedings of the Cambridge Philosophical Society, vol.37, issue.2, pp.194-197, 1941. ,
Subtrees of directed graphs and hypergraphs, Proceedings of the Eleventh Southeastern Conference on Combinatorics, Graph Theory and Computing, vol.I, pp.227-239, 1980. ,
On minimal digraphs with given girth. Department of Combinatorics and Optimization, 1978. ,
Equitable hypergraph orientations, Electron. J. Combin, vol.18, issue.1, 2011. ,
Bispindles in strongly connected digraphs with large chromatic number, The Electronic Journal of Combinatorics, vol.25, issue.2, pp.2-39, 2018. ,
DOI : 10.1016/j.endm.2017.10.013
URL : https://hal.archives-ouvertes.fr/hal-01810706
, Subdivisions of oriented cycles in digraphs with large chromatic number, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01411115
Equitable orientations of sparse uniform hypergraphs, The Electronic Journal of Combinatorics, vol.23, issue.4, pp.4-31, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01417832
A minimum degree condition forcing complete graph immersion, Combinatorica, vol.34, issue.3, pp.279-298, 2014. ,
DOI : 10.1007/s00493-014-2806-z
Immersing complete digraphs, European Journal of Combinatorics, vol.33, issue.6, pp.1294-1302, 2012. ,
Combinatorics and asymptotics on trees, Cubo Journal, vol.6, issue.2, 2004. ,
Graph theory and probability, Canad. J. Math, vol.11, pp.34-38, 1959. ,
On chromatic number of graphs and set-systems, Acta Mathematica Hungarica, vol.17, issue.1-2, pp.61-99, 1966. ,
Lopsided Lovász Local lemma and latin transversals, Discrete Applied Mathematics, vol.30, issue.2, pp.151-154, 1991. ,
Acyclic edge-coloring using entropy compression, European Journal of Combinatorics, vol.34, issue.6, pp.1019-1027, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00843770
Squaring a tournament: A proof of Dean's conjecture, Journal of Graph Theory, vol.23, issue.1, pp.43-48, 1996. ,
Probabilities within optimal strategies for tournament games, Discrete Applied Mathematics, vol.56, issue.1, pp.87-91, 1995. ,
Analytic Combinatorics, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00072739
The directed subgraph homeomorphism problem, Theoretical Computer Science, vol.10, issue.2, pp.111-121, 1980. ,
On directed paths and circuits, Theory of Graphs, pp.115-118, 1968. ,
Neighbour-distinguishing edge colourings of random regular graphs, Electronic Journal of Combinatorics, vol.13, p.77, 2006. ,
Graphs with k odd cycle lengths, Discrete Mathematics, vol.103, issue.1, pp.41-48, 1992. ,
Domination and fractional domination in digraphs ,
URL : https://hal.archives-ouvertes.fr/hal-01990176
Zur algebraischen bergrund der graphentheorie i, Math. Nachr, vol.28, pp.275-290, 1964. ,
? + 300 is a bound on the adjacent vertex distinguishing edge chromatic number, J. Combin. Theory Ser. B, vol.95, issue.2, pp.246-256, 2005. ,
Directed tree-width, Journal of Combinatorial Theory, Series B, vol.82, issue.1, pp.138-154, 2001. ,
, Progress on the adjacent vertex distinguishing edge colouring conjecture, 2018.
The directed grid theorem, Proceedings of the Forty-seventh Annual ACM Symposium on Theory of Computing, STOC '15, pp.655-664, 2015. ,
A weaker version of Lovász' path removal conjecture, Journal of Combinatorial Theory, Series B, vol.98, issue.5, pp.972-979, 2008. ,
A proof of Sumner's universal tournament conjecture for large tournaments, Proceedings of the London Mathematical Society, vol.102, issue.4, pp.731-766, 2011. ,
A note on complete subdivisions in digraphs of large outdegree, Journal of Graph Theory, vol.57, issue.1, pp.1-6, 2008. ,
Cycles with two blocks in k-chromatic digraphs, Journal of Graph Theory, issue.0, p.0 ,
Topological cliques in graphs ii, Combinatorics, Probability and Computing, vol.5, issue.1, pp.79-90, 1996. ,
Lower bound of the hadwiger number of graphs by their average degree, Combinatorica, vol.4, issue.4, pp.307-316, 1984. ,
Immersion of transitive tournaments in digraphs with large minimum outdegree, Journal of Combinatorial Theory, Series B, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01835124
Cycle length parities and the chromatic number, Journal of Graph Theory, vol.64, issue.3, pp.210-218, 2010. ,
Homomorphieeigenschaften und mittlere kantendichte von graphen, Mathematische Annalen, vol.174, issue.4, pp.265-268, 1967. ,
Existenz n-fach zusammenhängender teilgraphen in graphen genügend grosser kantendichte, Abh. Math. Sem. Univ. Hamburg, vol.37, 1972. ,
Degree and local connectivity in digraphs, Combinatorica, vol.5, issue.2, pp.161-165, 1985. ,
Existence of vertices of local connectivity k in digraphs of large outdegree, Combinatorica, vol.15, issue.4, pp.533-539, 1995. ,
Lectures on Discrete Geometry, 2002. ,
Zur allgemeinen kurventheorie, Fundamenta Mathematicae, vol.10, issue.1, pp.96-115, 1927. ,
Cycle lengths and chromatic number of graphs, Discrete Math, vol.286, issue.1-2, pp.147-149, 2004. ,
A constructive proof of the general Lovász Local Lemma, J. ACM, vol.57, issue.2, 2010. ,
A constructive proof of the Lovász Local Lemma, Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing, STOC '09, pp.343-350, 2009. ,
Domination in transitive colorings of tournaments, Journal of Combinatorial Theory, Series B, vol.107, pp.1-11, 2014. ,
Introducing directed tree width, Electronic Notes in Discrete Mathematics, vol.3, pp.222-229, 1999. ,
Graph minors. V. Excluding a planar graph, Journal of Combinatorial Theory, Series B, vol.41, issue.1, pp.92-114, 1986. ,
Graph minors .XIII. The disjoint paths problem, Journal of Combinatorial Theory, Series B, vol.63, issue.1, pp.65-110, 1995. ,
Graph minors. XX. Wagner's conjecture, Journal of Combinatorial Theory, Series B, vol.92, issue.2, pp.325-357, 2004. ,
Hadwiger's conjecture for k 6-free graphs, Combinatorica, vol.13, issue.3, pp.279-361, 1993. ,
Nombre chromatique et plus longs chemins d'un graphe. Rev. Francaise Informat, Recherche Operationnelle, vol.1, pp.129-132, 1967. ,
On monochromatic paths in edge-coloured digraphs, Journal of Combinatorial Theory, Series B, vol.33, issue.3, pp.271-275, 1982. ,
On the density of families of sets, Journal of Combinatorial Theory, Series A, vol.13, issue.1, pp.145-147, 1972. ,
Decomposing graphs under degree constraints, Journal of Graph Theory, vol.23, issue.3, pp.321-324 ,
A summary of problems and results related to the Caccetta-Häggkvist conjecture. arXiv preprint math/0605646, 2006. ,
An improved linear edge bound for graph linkages, European Journal of Combinatorics, vol.26, issue.3, pp.309-324, 2005. ,
Mathematical Proceedings of the Cambridge Philosophical Society, vol.95, pp.261-265, 1984. ,
Disjoint cycles in digraphs, Combinatorica, vol.3, issue.3, pp.393-396, 1983. ,
Even cycles in directed graphs, European Journal of Combinatorics, vol.6, issue.1, pp.85-89, 1985. ,
Highly connected non-2-linked digraphs, Combinatorica, vol.11, issue.4, pp.393-395, 1991. ,
Determination of minimal coloring of vertices of a graph by means of boolean powers of the incidence matrix, Doklady Akademii Nauk SSSR, vol.147, pp.758-759, 1962. ,
Structure and coloring of graphs with only small odd cycles, SIAM Journal on Discrete Mathematics, vol.22, issue.3, pp.1040-1072, 2008. ,
Adjacent strong edge coloring of graphs, Appl. Math. Lett, vol.15, issue.5, pp.623-626, 2002. ,