Parity vertex colorings of binomial trees

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10103314" target="_blank" >RIV/00216208:11320/12:10103314 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.7151/dmgt.1595" target="_blank" >http://dx.doi.org/10.7151/dmgt.1595</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.7151/dmgt.1595" target="_blank" >10.7151/dmgt.1595</a>

Result language

angličtina

Original language name

Parity vertex colorings of binomial trees

Original language description

We show for every k that the binomial tree of order 3k has a vertex-coloring with 2k+1 colors such that every path contains some color odd number of times. This disproves a conjecture of Boroviecki, Budajová, Jenrol and Krajči asserting that for every tree T the minimal number of colors in a such coloring of T is at least the vertex ranking number of T minus one.

Czech name

—

Czech description

—

Type

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

CEP classification

IN - Informatics

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2012

Confidentiality

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

Name of the periodical

Discussiones Mathematicae - Graph Theory

ISSN

1234-3099

e-ISSN

—

Volume of the periodical

32

Issue of the periodical within the volume

1

Country of publishing house

PL - POLAND

Number of pages

4

Pages from-to

177-180

UT code for WoS article

—

EID of the result in the Scopus database

—