Name
Abstract | ||
|---|---|---|
This paper is concerned with the subclass of graphs called cubic graphs. We survey these graphsand their history. Several classical graph theory results concerning cubic graphs are explained.Graph theory problems whose solutions on cubic graphs are particularly important or interestingare presented both from the sequential and parallel point of view. A new algorithm is presented forthe maximal matching problem restricted to cubic graphs. Many miscellaneous facts about cubicgraphs are... |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1145/234782.234783 | ACM Comput. Surv. |
Keywords | DocType | Volume |
complexity theory,discrete mathematics,matching,cubic graph,planar graphs,graph theory,coloring,<italic>np</italic>-completeness,regular graphs,cubic graphs,<italic>p</italic>-completeness | Journal | 27 |
Issue | Citations | PageRank |
4 | 23 | 2.08 |
References | Authors | |
25 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Raymond Greenlaw | 1 | 142 | 18.56 |
| Rossella Petreschi | 2 | 374 | 47.10 |