<--- Back to Details
First PageDocument Content
Graph theory / Mathematics / Graph coloring / Degree / Graph / Eulerian path / Ear decomposition / NP-complete problems / Graph operations / Dominating set / Incidence coloring
Date: 2016-03-02 03:52:29
Graph theory
Mathematics
Graph coloring
Degree
Graph
Eulerian path
Ear decomposition
NP-complete problems
Graph operations
Dominating set
Incidence coloring

Graph Editing to a Given Degree Sequence? Petr A. Golovach1,2 and George B. Mertzios3 1 Department of Informatics, University of Bergen, Norway, . 2

Add to Reading List

Source URL: community.dur.ac.uk

Download Document from Source Website

File Size: 317,05 KB

Share Document on Facebook

Similar Documents

Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook

Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook

DocID: 1xVkB - View Document

PDF Document

DocID: 1xkJU - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1vmTo - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1vhpu - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1v8nl - View Document