Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 4

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: hamiltonian cycle

Sortuj według:

Ogranicz wyniki do:

On Finding Hamiltonian Cycles in Barnette Graphs

Bagheri Gh. Behrooz, Feder Tomas, Fleischner Herbert, Subi Carlos

Fundamenta Informaticae

2022

Vol. 188 nr 1

1--14

In this paper we deal with hamiltonicity in planar cubic graphs G having a facial 2−factor Q via (quasi) spanning trees of faces in G/Q and study the algorithmic complexity of finding such (quasi) spanning trees of faces. Moreover, we show that if Barnette’s Conjecture is false, then hamiltonicity in 3−connected planar cubic bipartite graphs is an NP-complete problem.

Fan's condition on induced subgraphs for circumference and pancyclicity

Wideł W.

Opuscula Mathematica

2017

Vol. 37, no. 4

617--639

Let H be a family of simple graphs and k be a positive integer. We say that a graph G of order n ≥ k satisfies Fan's condition with respect to H with constant k, if for every induced subgraph H of G isomorphic to any of the graphs from H the following holds: [formula] If G satisfies the above condition, we write [formula]. In this paper we show that if G is 2-connected and [formula], then G contains a cycle of length at least k, and that if [formula], then G is pancyclic with some exceptions. As corollaries we obtain the previous results by Fan, Benhocine and Wojda, and Ning.

Graphs with every path of length k in a hamiltonian cycle

Gancarzewicz G.

Czasopismo Techniczne. Nauki Podstawowe

2014

R. 111, z. 2-NP

45--58

brak

Cycles containing specified edges in a graph

Gancarzewicz G.

Czasopismo Techniczne. Nauki Podstawowe

2014

R. 111, z. 2-NP

37--43

brak