Title of article
On 2-regular subgraphs in polyhedral graphs Original Research Article
Author/Authors
Frank G?ring، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
6
From page
97
To page
102
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.
Keywords
Domination , Cycle , Polyhedral graph
Journal title
Discrete Mathematics
Serial Year
2002
Journal title
Discrete Mathematics
Record number
950094
Link To Document