Jump to ContentJump to Main Navigation
Combinatorics: Ancient and Modern$
Users without a subscription are not able to see the full content.

Robin Wilson and John J. Watkins

Print publication date: 2013

Print ISBN-13: 9780199656592

Published to Oxford Scholarship Online: September 2013

DOI: 10.1093/acprof:oso/9780199656592.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2020. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 22 October 2020

Modern graph theory

Modern graph theory

(p.331) Chapter 14 Modern graph theory
Combinatorics: Ancient and Modern



Oxford University Press

During the first half of the 20th century many classic theorems about graphs were discovered, but it was not until the second half of the century that graph theory emerged as an important field in its own right. In this chapter we develop themes arising from the four-colour problem, before focusing on three specific subject areas — the factorization of graphs, connectivity, and graph algorithms.

Keywords:   graph theory, four-colour problem, factorization, connectivity, algorithms

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .