000			01184nmm a2200181Ia 4500
008			230306s9999||||xx |||||||||||||||||und||
020			_a9781470439378 (online)
245		0	_aGraph colouring and applications
260			_aProvidence, RI : _bAmerican Mathematical Society, _cc1999.
300			_a1 online resource (viii, 149 p. : ill.)
490			_aCRM Proceedings and Lecture Notes, _vv. 23 _x2472-4890
504			_aIncludes bibliographical references.
505			_tChromatic polynomials and mod _\lambda _ flows on directed graphs and their applications ; Four-coloring six-regular graphs on the torus ; On the complexity of a restricted list-coloring problem ; Totally critical graphs and the conformability conjecture ; Graphs whose radio coloring number equals the number of nodes ; The height and length of colour switching ; Characteristic polynomials in the theory of polyhedra ; The number of edge 3-colourings of the _n _-prism ; The cost of radio-colouring paths and cycles ; Restricted graph coloring: Some mathematical programming models
650			_aGraph coloring
700			_aHansen, P.
700			_aMarcotte, Odile
856			_uhttp://www.ams.org/crmp/023
999			_c28379 _d28379