Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
Type of Medium
Language
Region
Years
Person/Organisation
Subjects(RVK)
Keywords
Access
  • 1
    Online Resource
    Online Resource
    Amsterdam ; New York : North-Holland | New York, N.Y., U.S.A : Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co
    UID:
    b3kat_BV036962438
    Format: 1 Online-Ressource (261 p.) , ill , 25 cm
    Edition: Online-Ausgabe Elsevier e-book collection on ScienceDirect Sonstige Standardnummer des Gesamttitels: 041169-3
    ISBN: 0444705333 , 9780444705334
    Series Statement: Annals of discrete mathematics 39
    Note: "Reprinted from the journal Discrete mathematics, volume 74, nos. 1-2, 1989"--T.p. verso. - Includes bibliographical references , Urspruengliches Erscheinungsjahr:1989
    Additional Edition: Reproduktion von Graph colouring and variations 1989
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Amsterdam ; : North-Holland ;
    UID:
    almahu_9949697530702882
    Format: 1 online resource (269 p.)
    ISBN: 1-281-79327-2 , 9786611793272 , 0-08-086779-0
    Series Statement: Annals of discrete mathematics ; 39
    Content: Graph Colouring and Variations
    Note: "Reprinted from the journal Discrete mathematics, volume 74, nos. 1-2, 1989"--T.p. verso. , Front Cover; Graph Colouring and Variations; Copyright Page; Contents; Foreword; Chapter 1. Minimax relations for the partial q-colorings of a graph; Chapter 2. A min-max relation for the partial q-colourings of a graph. Part II: Box perfection; Chapter 3. On locally-perfect colorings; Chapter 4. The subchromatic number of a graph; Chapter 5. Connected sequential colorings; Chapter 6. Two conjectures on edge-colouring; Chapter 7. A new upper bound for the list chromatic number; Chapter 8. A note on perfect orders; Chapter 9. On the Penrose number of cubic diagrams , Chapter 10. On the edge achromatic numbers of complete graphsChapter 11. Applications of edge coloring of multigraphs to vertex coloring of graphs; Chapter 12. Interval vertex-coloring of a graph with forbidden colors; Chapter 13. Hadwiger's conjecture (k = 6): Neighbour configurations of 6-vertices in contraction-critical graphs; Chapter 14. About colorings, stability and paths in directed graphs; Chapter 15. On the harmonious chromatic number of a graph; Chapter 16. Weak bipolarizable graphs; Chapter 17. P4-comparability graphs , Chapter 18. On constructive methods in the theory of colour-critical graphsChapter 19. Chromatic partitions of a graph; Chapter 20. Sequential coloring versus Welsh-Powell bound; Chapter 21. A generalization of Robacker's theorem; Chapter 22. A randomised 3-colouring algorithm , English
    Additional Edition: ISBN 0-444-70533-3
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Amsterdam : North-Holland
    UID:
    gbv_1684906393
    Format: Online-Ressource
    Edition: Elsevier e-book collection on ScienceDirect
    ISBN: 0080867790 , 1281793272 , 9780080867793 , 9781281793270 , 0444705333 , 9780444705334
    Series Statement: Annals of discrete mathematics 39
    Content: Graph Colouring and Variations
    Content: Graph Colouring and Variations
    Note: "Reprinted from the journal Discrete mathematics, volume 74, nos. 1-2, 1989"--T.p. verso , Includes bibliographical references , Front Cover; Graph Colouring and Variations; Copyright Page; Contents; Foreword; Chapter 1. Minimax relations for the partial q-colorings of a graph; Chapter 2. A min-max relation for the partial q-colourings of a graph. Part II: Box perfection; Chapter 3. On locally-perfect colorings; Chapter 4. The subchromatic number of a graph; Chapter 5. Connected sequential colorings; Chapter 6. Two conjectures on edge-colouring; Chapter 7. A new upper bound for the list chromatic number; Chapter 8. A note on perfect orders; Chapter 9. On the Penrose number of cubic diagrams , Chapter 10. On the edge achromatic numbers of complete graphsChapter 11. Applications of edge coloring of multigraphs to vertex coloring of graphs; Chapter 12. Interval vertex-coloring of a graph with forbidden colors; Chapter 13. Hadwiger's conjecture (k = 6): Neighbour configurations of 6-vertices in contraction-critical graphs; Chapter 14. About colorings, stability and paths in directed graphs; Chapter 15. On the harmonious chromatic number of a graph; Chapter 16. Weak bipolarizable graphs; Chapter 17. P4-comparability graphs , Chapter 18. On constructive methods in the theory of colour-critical graphsChapter 19. Chromatic partitions of a graph; Chapter 20. Sequential coloring versus Welsh-Powell bound; Chapter 21. A generalization of Robacker's theorem; Chapter 22. A randomised 3-colouring algorithm; , English
    Additional Edition: ISBN 0444705333
    Additional Edition: Erscheint auch als Druck-Ausgabe Graph colouring and variations Amsterdam [u.a.] : North-Holland, 1989 ISBN 0444705333
    Language: English
    Keywords: Electronic books ; Electronic books
    URL: Volltext  (Deutschlandweit zugänglich)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Book
    Book
    Amsterdam [u.a.] :North-Holland,
    UID:
    almafu_BV002072155
    Format: 261 Seiten : , graph. Darst.
    ISBN: 0-444-70533-3
    Series Statement: Annals of Discrete Mathematics 39
    Language: English
    Subjects: Mathematics
    RVK:
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 0444703373?
Did you mean 0444701338?
Did you mean 0444700331?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages