CPC
2004
13 years 4 months ago
2004
CPC
2004
13 years 4 months ago
2004
CPC
2004
13 years 4 months ago
2004
CPC
2004
13 years 4 months ago
2004
CPC
2004
13 years 4 months ago
2004
Heap ordered trees are planted plane trees, labelled in such a way that the labels always increase from the root to a leaf. We study two parameters, assuming that p of the n nodes ...
CPC
2004
13 years 4 months ago
2004
CPC
2004
13 years 4 months ago
2004
Mader asked whether every C4-free graph G contains a subdivision of a complete graph whose order is at least linear in the average degree of G. We show that there is a subdivision...
CPC
2004
13 years 4 months ago
2004
CPC
2004
13 years 4 months ago
2004
The strong chromatic number, S(G), of an n-vertex graph G is the smallest number k such that after adding kn/k-n isolated vertices to G and considering any partition of the vertic...
CPC
2004
13 years 4 months ago
2004
Using representation theory, we obtain a necessary and sufficient condition for a discrete