Equitable colorations of graphs
R.I.R.O., 5 R3 (1971) 3-8
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):
Computer Aided Constellation Management and Communication Satellites
P. Abirami, N. Srinivasan and A. ParthibanLecture Notes in Electrical Engineering, Computer Aided Constellation Management and Communication Satellites 987 85 (2023)
https://doi.org/10.1007/978-981-19-8555-3_10
Mathematics and Computing
C. A. RodgerSpringer Proceedings in Mathematics & Statistics, Mathematics and Computing 253 1 (2018)
https://doi.org/10.1007/978-981-13-2095-8_1
Grooming traffic to minimize load
Charles J. Colbourn, Alan C.H. Ling, Gaetano Quattrocchi and Violet R. SyrotiukDiscrete Mathematics 312 (3) 536 (2012)
https://doi.org/10.1016/j.disc.2011.03.016
Computing and Combinatorics
Akiyoshi Shioura and Mutsunori YagiuraLecture Notes in Computer Science, Computing and Combinatorics 5609 116 (2009)
https://doi.org/10.1007/978-3-642-02882-3_13
From L. Euler to D. König
Dominique de WerraRAIRO - Operations Research 43 (3) 247 (2009)
https://doi.org/10.1051/ro/2009020
Computational Science – ICCS 2007
Huimin Song, Jianliang Wu and Guizhen LiuLecture Notes in Computer Science, Computational Science – ICCS 2007 4489 457 (2007)
https://doi.org/10.1007/978-3-540-72588-6_75
Discrete Geometry, Combinatorics and Graph Theory
Guizhen Liu and Changqing XuLecture Notes in Computer Science, Discrete Geometry, Combinatorics and Graph Theory 4381 101 (2007)
https://doi.org/10.1007/978-3-540-70666-3_11
STACS 2007
Benjamin DoerrLecture Notes in Computer Science, STACS 2007 4393 441 (2007)
https://doi.org/10.1007/978-3-540-70918-3_38
Good and nice colorings of balanced hypergraphs
D. de WerraDiscrete Mathematics 306 (19-20) 2630 (2006)
https://doi.org/10.1016/j.disc.2005.12.044
Partitions of large Boolean lattices
Zbigniew LoncDiscrete Mathematics 131 (1-3) 173 (1994)
https://doi.org/10.1016/0012-365X(94)90382-4
Matching Theory
North-Holland Mathematics Studies, Matching Theory 121 483 (1986)https://doi.org/10.1016/S0304-0208(08)73649-1
Regular and canonical colorings
D. de WerraDiscrete Mathematics 27 (3) 309 (1979)
https://doi.org/10.1016/0012-365X(79)90165-1
Studies in Integer Programming
D. de WerraAnnals of Discrete Mathematics, Studies in Integer Programming 1 179 (1977)
https://doi.org/10.1016/S0167-5060(08)70733-7
Combinatorial Programming: Methods and Applications
D. WerraCombinatorial Programming: Methods and Applications 305 (1975)
https://doi.org/10.1007/978-94-011-7557-9_16
Partitions of graphs into coverings and hypergraphs into transversals
D. WerraCommentarii Mathematici Helvetici 49 (1) 175 (1974)
https://doi.org/10.1007/BF02566726
Some results in chromatic scheduling
D. WerraZeitschrift für Operations Research 18 (5) 167 (1974)
https://doi.org/10.1007/BF02026597
A note on graph coloring
D. De WerraRevue française d'automatique informatique recherche opérationnelle. Informatique théorique 8 (R1) 49 (1974)
https://doi.org/10.1051/ita/197408R100491