Splitting trees

Splitting a tree is defined as removing all edges of a chain and disconnecting one from the other edges incident with that chain. Splitting a forest is simultaneously splitting each of its non-trivial trees. The splitting number σ( T) of a tree T is the minimum number of successive forest splittings...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete mathematics Vol. 165; pp. 403 - 419
Main Authors:	Hansen, Pierre, Hertz, Alain, Quinodoz, Nicolas
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.03.1997
Subjects:	algorithme polynomial arbre Chain chaîne coloration Coloring fente Polynomial algorithm Splitting Tree Coloring Chain chaîne Splitting arbre Tree coloration Polynomial algorithm fente algorithme polynomial
ISSN:	0012-365X, 1872-681X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!