Name
Abstract | ||
|---|---|---|
We show that every polyhedral graph G contains a 2-regular subgraph U such that G - U is a forest of trees with at most three leaves. With this tool we give a partial solution of a problem posed in a problem session at the Workshop "Cycles and Colourings '98" in Stará Lesná, Slovakia. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0012-365X(01)00329-6 | Discrete Mathematics |
Keywords | Field | DocType |
polyhedral graph,domination,05c15,2-regular subgraphs,partial solution,problem session,05c38,cycle,05c69,2-regular subgraph | Graph theory,Discrete mathematics,Graph,Combinatorics,Polyhedral graph,Cycle graph,Regular graph,Mathematics | Journal |
Volume | Issue | ISSN |
251 | 1 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frank Göring | 1 | 53 | 9.00 |