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):

Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality

Jaroslav Nesetril and Claude Tardif
SIAM Journal on Discrete Mathematics 19 (4) 914 (2005)
DOI: 10.1137/S0895480104445630
See this article

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)
DOI: 10.1016/j.disc.2013.01.011
See this article

On a generalization of the Gallai–Roy–Vitaver theorem to the bandwidth coloring problem

Bernard Gendron, Alain Hertz and Patrick St-Louis
Operations Research Letters 36 (3) 345 (2008)
DOI: 10.1016/j.orl.2007.09.004
See this article

Antidirected Hamiltonian paths in tournaments

Branko Grünbaum
Journal of Combinatorial Theory, Series B 11 (3) 249 (1971)
DOI: 10.1016/0095-8956(71)90035-9
See this article

Component Games on Regular Graphs

RANI HOD and ALON NAOR
Combinatorics, Probability and Computing 23 (01) 75 (2014)
DOI: 10.1017/S0963548313000527
See this article

Graph Saturation Games

Ago-Erik Riet and Jonathan Lee
Electronic Notes in Discrete Mathematics 50 349 (2015)
DOI: 10.1016/j.endm.2015.07.058
See this article

The Ramsey number of loose cycles versus cliques

Arès Méroueh
Journal of Graph Theory 90 (2) 172 (2019)
DOI: 10.1002/jgt.22387
See this article

Monochromatic paths in random tournaments

Matija Bucić, Shoham Letzter and Benny Sudakov
Random Structures & Algorithms 54 (1) 69 (2019)
DOI: 10.1002/rsa.20780
See this article

Directed Ramsey number for trees

Matija Bucić, Shoham Letzter and Benny Sudakov
Electronic Notes in Discrete Mathematics 61 169 (2017)
DOI: 10.1016/j.endm.2017.06.035
See this article

Denis Bouyssou and Daniel Vanderpooten
147 753 (2011)
DOI: 10.1007/978-1-4419-6281-2_42
See this article

Mixed graph colorings

Pierre Hansen, Julio Kuplinsky and Dominique de Werra
Mathematical Methods of Operations Research 45 (1) 145 (1997)
DOI: 10.1007/BF01194253
See this article

Four color theorem from three points of view

Yuri Matiyasevich
Illinois Journal of Mathematics 60 (1) (2016)
DOI: 10.1215/ijm/1498032030
See this article

Sangita Roy, Hardik Chawla and Ashok Singh Sairam
939 153 (2019)
DOI: 10.1007/978-981-13-7561-3_12
See this article

Interleaved adjoints of directed graphs

Jan Foniok, Jaroslav Nešetřil and Claude Tardif
European Journal of Combinatorics 32 (7) 1018 (2011)
DOI: 10.1016/j.ejc.2011.03.013
See this article

Subdivisions of oriented cycles in digraphs with large chromatic number

Nathann Cohen, Frédéric Havet, William Lochet and Nicolas Nisse
Journal of Graph Theory 89 (4) 439 (2018)
DOI: 10.1002/jgt.22360
See this article

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. Tran
Oil & Gas Science and Technology – Revue d’IFP Energies nouvelles 74 49 (2019)
DOI: 10.2516/ogst/2019009
See this article

Yaokun Wu and Yinfeng Zhu
12159 406 (2020)
DOI: 10.1007/978-3-030-50026-9_30
See this article

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 Lee
Graphs and Combinatorics 35 (4) 921 (2019)
DOI: 10.1007/s00373-019-02046-x
See this article

Density via duality

Jaroslav Nešetřil and Claude Tardif
Theoretical Computer Science 287 (2) 585 (2002)
DOI: 10.1016/S0304-3975(01)00263-8
See this article

Stable set meeting every longest path

F. Havet
Discrete Mathematics 289 (1-3) 169 (2004)
DOI: 10.1016/j.disc.2004.07.013
See this article

Bispindle in strongly connected digraphs with large chromatic number

Nathann Cohen, Frédéric Havet, William Lochet and Raul Lopes
Electronic Notes in Discrete Mathematics 62 69 (2017)
DOI: 10.1016/j.endm.2017.10.013
See this article

Edge-Orienting on Split, Planar and Treelike Graphs

William Chung-Kung Yen
The Computer Journal 50 (3) 357 (2007)
DOI: 10.1093/comjnl/bxl068
See this article

Advances in Aharoni-Hartman-Hoffman's Conjecture for Split digraphs

Maycon Sambinelli, Cândida Nunes da Silva and Orlando Lee
Electronic Notes in Discrete Mathematics 62 111 (2017)
DOI: 10.1016/j.endm.2017.10.020
See this article

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)
DOI: 10.1016/j.jctb.2006.10.001
See this article

Acyclic subgraphs of tournaments with high chromatic number

Jacob Fox, Matthew Kwan and Benny Sudakov
Bulletin of the London Mathematical Society (2021)
DOI: 10.1112/blms.12446
See this article

A note on strong perfectness of graphs

M. Preissmann and D. de Werra
Mathematical Programming 31 (3) 321 (1985)
DOI: 10.1007/BF02591953
See this article

Monochromatic paths in random tournaments

Matija Bucić, Shoham Letzter and Benny Sudakov
Electronic Notes in Discrete Mathematics 61 177 (2017)
DOI: 10.1016/j.endm.2017.06.036
See this article

Cycles with two blocks in k -chromatic digraphs

Ringi Kim, Seog-Jin Kim, Jie Ma and Boram Park
Journal of Graph Theory 88 (4) 592 (2018)
DOI: 10.1002/jgt.22232
See this article

Acyclic Orientations with Path Constraints

Rosa M. V. Figueiredo, Valmir C. Barbosa, Nelson Maculan and Cid C. de Souza
RAIRO - Operations Research 42 (4) 455 (2008)
DOI: 10.1051/ro:2008028
See this article

χ-bounded families of oriented graphs

P. Aboulker, J. Bang-Jensen, N. Bousquet, P. Charbit, F. Havet, F. Maffray and J. Zamora
Journal of Graph Theory 89 (3) 304 (2018)
DOI: 10.1002/jgt.22252
See this article