<<A>> note on hamiltonicity of generalized net-free graphs of large diameter

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F02%3A00070107" target="_blank" >RIV/49777513:23520/02:00070107 - isvavai.cz</a>

Alternative codes found

RIV/49777513:23520/02:00000216

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

<<A>> note on hamiltonicity of generalized net-free graphs of large diameter

Original language description

A generalized $(i,j,k)$-net $N_{i,j,k}$ is the graph obtained by identifying each of the vertices of a triangle with an endvertex of one of three vertex-disjoint paths of lengths $i,j,k$. We prove that every 2-connected claw-free $N_{1,2,j}$-free graph of diameter at least $max {7,2j}(jgeqslant 2)$ is hamiltonian.

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

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2002

Confidentiality

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

Name of the periodical

Discrete Mathematics

ISSN

0012365X

e-ISSN

—

Volume of the periodical

Vol. 251

Issue of the periodical within the volume

leden

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

9

Pages from-to

77

UT code for WoS article

—

EID of the result in the Scopus database

—