EuDML | Browse

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Subjects
05-XX Combinatorics
05Cxx Graph theory
05C35 Extremal problems

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 2

Displaying 21 – 22 of 22

Remarks on the existence of uniquely partitionable planar graphs

Mieczysław Borowiecki, Peter Mihók, Zsolt Tuza, M. Voigt (1999)

Discussiones Mathematicae Graph Theory

We consider the problem of the existence of uniquely partitionable planar graphs. We survey some recent results and we prove the nonexistence of uniquely (𝓓₁,𝓓₁)-partitionable planar graphs with respect to the property 𝓓₁ "to be a forest".

Repetition number of graphs.

Caro, Yair, West, Douglas B. (2009)

The Electronic Journal of Combinatorics [electronic only]

Currently displaying 21 – 22 of 22

Previous Page 2