Skip to content

Opening book details…

Can I read On 2-Regular Subgraphs in Polyhedral Graphs on EtoBox?

On 2-Regular Subgraphs in Polyhedral Graphs by Frank Göring is a Computer Science article available to read on EtoBox.

What is On 2-Regular Subgraphs in Polyhedral Graphs about?

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à a Lesnà a, Slovakia.

Who reads On 2-Regular Subgraphs in Polyhedral Graphs?

It is typically read by researchers, students, and practitioners in Computer Science.

Author
Frank Göring
Publisher
Elsevier Science; Elsevier ; Elsevier BV (ISSN 0012-365X)
Published
2002
Language
EN
Field
Computer Science (Physical Sciences)

More by Frank Göring

Browse all works by Frank Göring