Line Graphs of Multigraphs and Hamilton-Connectedness of Claw-Free Graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F11%3A43898383" target="_blank" >RIV/49777513:23520/11:43898383 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1002/jgt.20498" target="_blank" >http://dx.doi.org/10.1002/jgt.20498</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1002/jgt.20498" target="_blank" >10.1002/jgt.20498</a>

Result language

angličtina

Original language name

Line Graphs of Multigraphs and Hamilton-Connectedness of Claw-Free Graphs

Original language description

We introduce a closure concept that turns a claw-free graph into the line graph of a multigraph while preserving its (non-)Hamiltonconnectedness. As an application, we show that every 7-connected claw-free graph is Hamilton-connected, and we show that the well-known conjecture by Matthews and Sumner is equivalent with the statement that every 4-connected claw-free graph is Hamilton-connected.

Czech name

—

Czech description

—

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/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Publication year

2011

Confidentiality

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

Name of the periodical

Journal of Graph Theory

ISSN

0364-9024

e-ISSN

—

Volume of the periodical

66

Issue of the periodical within the volume

2

Country of publishing house

US - UNITED STATES

Number of pages

22

Pages from-to

152-173

UT code for WoS article

—

EID of the result in the Scopus database

—