2-edge-Hamiltonian-connectedness of 4-connected plane graphs

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F14%3A43920431" target="_blank" >RIV/49777513:23520/14:43920431 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.ejc.2013.06.033" target="_blank" >http://dx.doi.org/10.1016/j.ejc.2013.06.033</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.ejc.2013.06.033" target="_blank" >10.1016/j.ejc.2013.06.033</a>

Jazyk výsledku

angličtina

Název v původním jazyce

2-edge-Hamiltonian-connectedness of 4-connected plane graphs

Popis výsledku v původním jazyce

A graph G is called 2-edge-Hamiltonian-connect,ed if for every two edges e,f, G has a Hamiltonian cycle containing the edges e,f. In this paper, we show that every 4-connected plane graph is 2-edge-Hamiltonian-connected. This result is best possible in many senses and an extension of several known results on Hamiltonicity of 4-connected plane graphs, for example, Tutte`s result saying that every 4-connected plane graph is Hamiltonian, and Thomassen`s result saying that every 4-connected plane graph is Hamiltonian-connected. We also show that although the problem of deciding whether a given graph is 2-edge-Hamiltonian-connected is NP-complete, there exists a polynomial time algorithm to solve the problem if we restrict the input to plane graphs.

Název v anglickém jazyce

2-edge-Hamiltonian-connectedness of 4-connected plane graphs

Popis výsledku anglicky

A graph G is called 2-edge-Hamiltonian-connect,ed if for every two edges e,f, G has a Hamiltonian cycle containing the edges e,f. In this paper, we show that every 4-connected plane graph is 2-edge-Hamiltonian-connected. This result is best possible in many senses and an extension of several known results on Hamiltonicity of 4-connected plane graphs, for example, Tutte`s result saying that every 4-connected plane graph is Hamiltonian, and Thomassen`s result saying that every 4-connected plane graph is Hamiltonian-connected. We also show that although the problem of deciding whether a given graph is 2-edge-Hamiltonian-connected is NP-complete, there exists a polynomial time algorithm to solve the problem if we restrict the input to plane graphs.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

<a href="/cs/project/ED1.1.00%2F02.0090" target="_blank" >ED1.1.00/02.0090: NTIS - Nové technologie pro informační společnost</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2014

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

EUROPEAN JOURNAL OF COMBINATORICS

ISSN

0195-6698

e-ISSN

—

Svazek periodika

35

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

17

Strana od-do

432-448

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—