cyclomatic number | Sciweavers

APPML
2005

67views more APPML 2005»

13 years 4 months ago

Download www.mathematik.uni-bielefeld.de

Let the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that, for every integer c 2, there are at most finitely many trunks of semiharmonic graphs ...

Stefan Grünewald, Dragan Stevanovic

claim paper

Read More »

click to vote

DM
2010

83views more DM 2010»

Packing edge-disjoint cycles in graphs and the cyclomatic number

13 years 4 months ago

Download www.tu-ilmenau.de

For a graph G let

Jochen Harant, Dieter Rautenbach, Peter Recht, Fri...

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers