On 2-walks in chordal planar graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F09%3A00501592" target="_blank" >RIV/49777513:23520/09:00501592 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On 2-walks in chordal planar graphs
Original language description
A 2-walk is a closed spanning trail which uses every vertex at most twice. A graph is said to be chordal if each cycle different from a 3-cycle has a chord. We prove that every chordal planar graph G with toughness t(G)>3/4 has a 2-walk.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
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>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Discrete Mathematics
ISSN
0012-365X
e-ISSN
—
Volume of the periodical
2009
Issue of the periodical within the volume
309
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
10
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
—