Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: graph decompositions

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Decompositions of quadrangle-free planar graphs

100%

Borodin O., Ivanova A., Kostochka A., Sheikh N.

Discussiones Mathematicae Graph Theory

2009

tom 29

nr 1

87-99

W. He et al. showed that a planar graph not containing 4-cycles can be decomposed into a forest and a graph with maximum degree at most 7. This degree restriction was improved to 6 by Borodin et al. We further lower this bound to 5 and show that it cannot be improved to 3.

Hamilton decompositions of line graphs of some bipartite graphs

100%

Pike D.

Discussiones Mathematicae Graph Theory

2005

tom 25

nr 3

303-310

Some bipartite Hamilton decomposable graphs that are regular of degree δ ≡ 2 (mod 4) are shown to have Hamilton decomposable line graphs. One consequence is that every bipartite Hamilton decomposable graph G with connectivity κ(G) = 2 has a Hamilton decomposable line graph L(G).

Ograniczanie wyników

2 Discussiones Mathematicae Graph Theory

1 Borodin O.

1 Ivanova A.

1 Kostochka A.

1 Pike D.

1 Sheikh N.

1 2009

1 2005

Wyniki wyszukiwania

Decompositions of quadrangle-free planar graphs

Hamilton decompositions of line graphs of some bipartite graphs