Nombre chromatique et plus longs chemins d'un graphe
R.I.R.O., 1 5 (1967) 129-132
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Secant edges: a tool for Cohen et al.’s conjectures about subdivisions of oriented cycles and bispindles in Hamiltonian digraphs with large chromatic number
Darine Al-Mniny and Salman GhazalGraphs and Combinatorics 41 (1) (2025)
https://doi.org/10.1007/s00373-024-02865-7
Orientable burning number of graphs
Julien Courtiel, Paul Dorbec, Tatsuya Gima, Romain Lecoq and Yota OtachiDiscrete Applied Mathematics 367 116 (2025)
https://doi.org/10.1016/j.dam.2025.02.004
15538 51 (2025)
https://doi.org/10.1007/978-3-031-82670-2_5
14760 79 (2025)
https://doi.org/10.1007/978-3-031-75409-8_6
14422 141 (2024)
https://doi.org/10.1007/978-3-031-49190-0_10
Ramsey numbers of sparse digraphs
Jacob Fox, Xiaoyu He and Yuval WigdersonIsrael Journal of Mathematics 263 (1) 1 (2024)
https://doi.org/10.1007/s11856-024-2624-y
The Existence of a Path with Two Blocks in Digraphs
Amine El Sahili, Maidoun Mortada and Sara NasserGraphs and Combinatorics 40 (2) (2024)
https://doi.org/10.1007/s00373-024-02759-8
14549 377 (2024)
https://doi.org/10.1007/978-981-97-0566-5_27
LATIN 2022: Theoretical Informatics
Caroline Aparecida de Paula Silva, Cândida Nunes da Silva and Orlando LeeLecture Notes in Computer Science, LATIN 2022: Theoretical Informatics 13568 460 (2022)
https://doi.org/10.1007/978-3-031-20624-5_28
Acyclic subgraphs of tournaments with high chromatic number
Jacob Fox, Matthew Kwan and Benny SudakovBulletin of the London Mathematical Society 53 (2) 619 (2021)
https://doi.org/10.1112/blms.12446
Computer Science – Theory and Applications
Yaokun Wu and Yinfeng ZhuLecture Notes in Computer Science, Computer Science – Theory and Applications 12159 406 (2020)
https://doi.org/10.1007/978-3-030-50026-9_30
A method for parallel scheduling of multi-rate co-simulation on multi-core platforms
Salah Eddine Saidi, Nicolas Pernet, Yves Sorel, A. Anciaux-Sedrakian and Q. H. TranOil & Gas Science and Technology – Revue d’IFP Energies nouvelles 74 49 (2019)
https://doi.org/10.2516/ogst/2019009
Monochromatic paths in random tournaments
Matija Bucić, Shoham Letzter and Benny SudakovRandom Structures & Algorithms 54 (1) 69 (2019)
https://doi.org/10.1002/rsa.20780
The Ramsey number of loose cycles versus cliques
Arès MérouehJournal of Graph Theory 90 (2) 172 (2019)
https://doi.org/10.1002/jgt.22387
Berge’s Conjecture and Aharoni–Hartman–Hoffman’s Conjecture for Locally In-Semicomplete Digraphs
Maycon Sambinelli, Carla Negri Lintzmayer, Cândida Nunes da Silva and Orlando LeeGraphs and Combinatorics 35 (4) 921 (2019)
https://doi.org/10.1007/s00373-019-02046-x
Security and Privacy
Sangita Roy, Hardik Chawla and Ashok Singh SairamCommunications in Computer and Information Science, Security and Privacy 939 153 (2019)
https://doi.org/10.1007/978-981-13-7561-3_12
χ-bounded families of oriented graphs
P. Aboulker, J. Bang-Jensen, N. Bousquet, et al.Journal of Graph Theory 89 (3) 304 (2018)
https://doi.org/10.1002/jgt.22252
Cycles with two blocks in k‐chromatic digraphs
Ringi Kim, Seog‐Jin Kim, Jie Ma and Boram ParkJournal of Graph Theory 88 (4) 592 (2018)
https://doi.org/10.1002/jgt.22232
Subdivisions of oriented cycles in digraphs with large chromatic number
Nathann Cohen, Frédéric Havet, William Lochet and Nicolas NisseJournal of Graph Theory 89 (4) 439 (2018)
https://doi.org/10.1002/jgt.22360
Monochromatic paths in random tournaments
Matija Bucić, Shoham Letzter and Benny SudakovElectronic Notes in Discrete Mathematics 61 177 (2017)
https://doi.org/10.1016/j.endm.2017.06.036
Bispindle in strongly connected digraphs with large chromatic number
Nathann Cohen, Frédéric Havet, William Lochet and Raul LopesElectronic Notes in Discrete Mathematics 62 69 (2017)
https://doi.org/10.1016/j.endm.2017.10.013
Directed Ramsey number for trees
Matija Bucić, Shoham Letzter and Benny SudakovElectronic Notes in Discrete Mathematics 61 169 (2017)
https://doi.org/10.1016/j.endm.2017.06.035
Advances in Aharoni-Hartman-Hoffman's Conjecture for Split digraphs
Maycon Sambinelli, Cândida Nunes da Silva and Orlando LeeElectronic Notes in Discrete Mathematics 62 111 (2017)
https://doi.org/10.1016/j.endm.2017.10.020
Four color theorem from three points of view
Yuri MatiyasevichIllinois Journal of Mathematics 60 (1) (2016)
https://doi.org/10.1215/ijm/1498032030
Graph Saturation Games
Ago-Erik Riet and Jonathan LeeElectronic Notes in Discrete Mathematics 50 349 (2015)
https://doi.org/10.1016/j.endm.2015.07.058
Component Games on Regular Graphs
RANI HOD and ALON NAORCombinatorics, Probability and Computing 23 (1) 75 (2014)
https://doi.org/10.1017/S0963548313000527
Oriented trees in digraphs
Louigi Addario-Berry, Frédéric Havet, Cláudia Linhares Sales, Bruce Reed and Stéphan ThomasséDiscrete Mathematics 313 (8) 967 (2013)
https://doi.org/10.1016/j.disc.2013.01.011
147 753 (2011)
https://doi.org/10.1007/978-1-4419-6281-2_42
Interleaved adjoints of directed graphs
Jan Foniok, Jaroslav Nešetřil and Claude TardifEuropean Journal of Combinatorics 32 (7) 1018 (2011)
https://doi.org/10.1016/j.ejc.2011.03.013
Path homomorphisms, graph colorings, and boolean matrices
Jaroslav Nešetřil and Claude TardifJournal of Graph Theory 63 (3) 198 (2010)
https://doi.org/10.1002/jgt.20420
Acyclic Orientations with Path Constraints
Rosa M. V. Figueiredo, Valmir C. Barbosa, Nelson Maculan and Cid C. de SouzaRAIRO - Operations Research 42 (4) 455 (2008)
https://doi.org/10.1051/ro:2008028
On a generalization of the Gallai–Roy–Vitaver theorem to the bandwidth coloring problem
Bernard Gendron, Alain Hertz and Patrick St-LouisOperations Research Letters 36 (3) 345 (2008)
https://doi.org/10.1016/j.orl.2007.09.004
Edge-Orienting on Split, Planar and Treelike Graphs
William Chung-Kung YenThe Computer Journal 50 (3) 357 (2007)
https://doi.org/10.1093/comjnl/bxl068
Paths with two blocks in n-chromatic digraphs
L. Addario-Berry, F. Havet and S. ThomasséJournal of Combinatorial Theory, Series B 97 (4) 620 (2007)
https://doi.org/10.1016/j.jctb.2006.10.001
Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality
Jaroslav Nesetril and Claude TardifSIAM Journal on Discrete Mathematics 19 (4) 914 (2005)
https://doi.org/10.1137/S0895480104445630
Stable set meeting every longest path
F. HavetDiscrete Mathematics 289 (1-3) 169 (2004)
https://doi.org/10.1016/j.disc.2004.07.013
Density via duality
Jaroslav Nešetřil and Claude TardifTheoretical Computer Science 287 (2) 585 (2002)
https://doi.org/10.1016/S0304-3975(01)00263-8
Mixed graph colorings
Pierre Hansen, Julio Kuplinsky and Dominique de WerraMathematical Methods of Operations Research 45 (1) 145 (1997)
https://doi.org/10.1007/BF01194253
Computational Graph Theory
D. de WerraComputing Supplementum, Computational Graph Theory 7 191 (1990)
https://doi.org/10.1007/978-3-7091-9076-0_10
A note on strong perfectness of graphs
M. Preissmann and D. de WerraMathematical Programming 31 (3) 321 (1985)
https://doi.org/10.1007/BF02591953
Antidirected Hamiltonian paths in tournaments
Branko GrünbaumJournal of Combinatorial Theory, Series B 11 (3) 249 (1971)
https://doi.org/10.1016/0095-8956(71)90035-9