Graph coloring with cardinality constraints on the neighborhoods

Discrete Optimization

Volumn 6, Issue 4, 2009, Pages 362-369

  Costa, M C ^a   de Werra, D ^b   Picouleau, C ^c   Ries, B ^b  

^a ENSTA PARISTECH   (France)

^b EPFL   (Switzerland)

^c Bioinformatique et Chimie Moléculaire   (France)

Author keywords

Bipartite graph; Cardinality constrained colorings; Tree; Vertex coloring

Indexed keywords

BIPARTITE GRAPH; CARDINALITY CONSTRAINED COLORINGS; CARDINALITY CONSTRAINTS; GRAPH COLORINGS; GRAPH G; K-COLORING; SOLVABLE CASE; TREE; VERTEX COLORING; VERTEX SET;

COLORING;

GRAPH THEORY;

EID: 68349105018     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2009.04.005     Document Type: Article

References (25)

1. Berge C. Graphes (1983), Gauthier-Villars, Paris
2. Bentz C., Costa M.C., de Werra D., Picouleau C., and Ries B. On a graph coloring problem arising from discrete tomography. Networks 51 4 (2008) 256-267
3. Baker B.S., and Coffman E.G. Mutual exclusion scheduling. Theoretical Computer Science 162 (1996) 225-243
4. Chen B.-L., and Lih K.-W. Equitable coloring of trees. Journal of Combinatorial Theory, Series B 61 1 (1994) 83-87
5. de Werra D., Hertz A., Kobler D., and Mahadev N.V.R. Feasible edge colorings of trees with cardinality constraints. Discrete Mathematics 222 (2000) 61-72
6. Hansen P., Hertz A., and Kuplinsky J. Bounded vertex colorings of graphs. Discrete Mathematics 111 (1993) 305-312
7. Jarvis M., and Zhou B. Bounded vertex coloring of trees. Discrete Mathematics 232 (2001) 145-151
8. Calamoneri T. The L (h, k)-labelling problem: A survey and annotated bibliography. The Computer Journal 49 5 (2006) 585-608
9. Fertin G., Raspaud A., and Reed B. Star coloring of graphs. Journal of Graph Theory 47 3 (2004) 163-182
10. Hind H., Molloy M., and Reed B. Colouring a graph frugally. Combinatorica 17 4 (1997) 469-482
11. Gyo{double acute}ri E., Horn ̌ák M., Palmer C., and Woźniak M. General neighbour-distinguishing index of a graph. Discrete Mathematics 308 (2008) 827-831
12. Havet F., and Yu M.-L. (p, 1)-Total Labelling of graphs. Discrete Mathematics 308 (2008) 496-513
13. Kramer F., and Kramer H. A survey on the distance-colouring of graphs. Discrete Mathematics 308 (2008) 422-426
14. Omoomi B., and Pourmiri A. Local colourings of Kneser graphs. Discrete Mathematics 308 24 (2008) 5922-5927
15. Williams J., and Holroyd F. Semi-total graph colourings, the beta parameter, and total chromatic number. Discrete Mathematics 308 (2008) 940-954
16. Zhou S. A distance-labelling problem for hypercubes. Discrete Applied Mathematics 156 15 (2008) 2846-2854
17. G. May, Castigat ridendo mores. Revue in Luxemburg 1896-1940, Ein Kapitel nationaler Theatergeschichte, Nos Cahiers, Lëtzebuerger Zäitschrëft fir Kultur, 6. Joër, 1985, pp. 38-54
18. Cowen L., Goddard W., and Jesurum C.E. Defective coloring revisited. Journal of Graph Theory 23 3 (1997) 205-219
19. Garey M.R., and Johnson D.S. Computers and Intractability, a Guide to the Theory of NP-Completeness (1979), Freeman, New York
20. Moore C., and Robson J.M. Hard tiling problems with simple tiles. Discrete & Computational Geometry 26 (2001) 573-590
21. Holyer I. N P-completeness of edge-coloring. SIAM Journal on Computing 10 (1981) 718-720
22. McDiarmid C.J., and Sanchez-Arroyo A. Total colouring regular bipartite graphs is N P-hard. Discrete Mathematics 124 (1994) 155-162
23. Dailey D.P. Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete. Discrete Mathematics 30 (1980) 289-293
24. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network Flows (1993), Prentice-Hall, Englewood Cliffs
25. van Win E. Famille Vandievoet à Schaerbeek au XVIII ème siècle. L'intermédiaire des généalogistes 195 (1978) 255-256