Graph algorithms and complexity aspects on special graph classes
Graphs are a very flexible tool within mathematics, as such, numerous problems can be solved by formulating them as an instance of a graph. As a result, however, some of the structures found in real world problems may be lost in a more general graph. An example of this is the 4-Colouring problem whi...
Main Author: | Stewart, Anthony Graham |
---|---|
Published: |
Durham University
2017
|
Subjects: | |
Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.716299 |
Similar Items
-
The complexity of greedy algorithms on ordered graphs
by: Puricella, Antonio
Published: (2002) -
Aspects of graph colouring
by: Williams, Jini
Published: (2004) -
Fixed-parameter tractable algorithms in graph theory
by: Soleimanfallah, Arezou
Published: (2010) -
Topics in graph colouring and extremal graph theory
by: Feghali, Carl
Published: (2016) -
Computer algorithms for scheduling and related problems in the theory of graphs
by: Selim, Said Mahmoud
Published: (1974)