A note on the shortness coefficient and the Hamiltonicity of 4-connected line graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F05%3A00000211" target="_blank" >RIV/49777513:23520/05:00000211 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

A note on the shortness coefficient and the Hamiltonicity of 4-connected line graphs

Original language description

Thomassen proposed a well-known conjecture: every 4-connected line graph is hamiltonian. In this note, we show that Thomassens conjecture is equivalent to the statement that the shortness coefficient of the class of all 4-connected line graphs is one and

Czech name

O koeficientu krátkosti a hamiltonovské kružnici ve 4-souvislých hranových grafech

Czech description

V článku je dokázána ekvivalence thomasenovy hypotézy a tvrzení: každý 4-souvislý hranový graf má koeficient krátkosti roven jedné

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

<a href="/en/project/LN00A056" target="_blank" >LN00A056: Institute of Theoretical Computer Science (Center of Young Science)</a><br>

Continuities

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

Publication year

2005

Confidentiality

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

Name of the periodical

Graphs and Combinatorics

ISSN

0911-0119

e-ISSN

—

Volume of the periodical

21

Issue of the periodical within the volume

—

Country of publishing house

JP - JAPAN

Number of pages

8

Pages from-to

137-144

UT code for WoS article

—

EID of the result in the Scopus database

—