l-facial edge colorings of graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F15%3A43923609" target="_blank" >RIV/49777513:23520/15:43923609 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.dam.2014.10.009" target="_blank" >http://dx.doi.org/10.1016/j.dam.2014.10.009</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.dam.2014.10.009" target="_blank" >10.1016/j.dam.2014.10.009</a>
Alternative languages
Result language
angličtina
Original language name
l-facial edge colorings of graphs
Original language description
It is conjectured that 3l+1 colors suffice for an l-facial edge coloring of any plane graph. We prove that 7 colors suffice for a 2-facial edge coloring of any plane graph and therefore we confirm the conjecture for l=2.
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/EE2.3.30.0038" target="_blank" >EE2.3.30.0038: New excellence in human resources</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2015
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 APPLIED MATHEMATICS
ISSN
0166-218X
e-ISSN
—
Volume of the periodical
181
Issue of the periodical within the volume
30.01.2015
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
8
Pages from-to
193-200
UT code for WoS article
000347364700020
EID of the result in the Scopus database
—