On the total versions of 1-2-3-Conjecture for graphs and hypergraphs

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F23%3A00571157" target="_blank" >RIV/67985807:_____/23:00571157 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1016/j.dam.2023.03.021" target="_blank" >https://doi.org/10.1016/j.dam.2023.03.021</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.dam.2023.03.021" target="_blank" >10.1016/j.dam.2023.03.021</a>

Jazyk výsledku

angličtina

Název v původním jazyce

On the total versions of 1-2-3-Conjecture for graphs and hypergraphs

Popis výsledku v původním jazyce

In 2004, Karoński, Łuczak and Thomason proposed 1-2-3-Conjecture: For every nice graph G there is an edge weighting function w:E(G)→{1,2,3} such that the induced vertex coloring is proper. After that, the total versions of this conjecture were suggested in the literature and recently, Kalkowski et al. have generalized this conjecture to hypergraphs. In this paper, some previously known results on the total versions are improved. Moreover, an affirmative answer is given to the conjecture for some well-known families of hypergraphs like complete n-partite hypergraphs, paths, cycles, theta hypergraphs and some geometric planes. Also, these hypergraphs are characterized based on the corresponding parameter.

Název v anglickém jazyce

On the total versions of 1-2-3-Conjecture for graphs and hypergraphs

Popis výsledku anglicky

In 2004, Karoński, Łuczak and Thomason proposed 1-2-3-Conjecture: For every nice graph G there is an edge weighting function w:E(G)→{1,2,3} such that the induced vertex coloring is proper. After that, the total versions of this conjecture were suggested in the literature and recently, Kalkowski et al. have generalized this conjecture to hypergraphs. In this paper, some previously known results on the total versions are improved. Moreover, an affirmative answer is given to the conjecture for some well-known families of hypergraphs like complete n-partite hypergraphs, paths, cycles, theta hypergraphs and some geometric planes. Also, these hypergraphs are characterized based on the corresponding parameter.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

Projekt

<a href="/cs/project/GA19-08740S" target="_blank" >GA19-08740S: Vnořování, pakování a limity v Grafech</a><br>

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2023

Kód důvěrnosti údajů

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

Název periodika

Discrete Applied Mathematics

ISSN

0166-218X

e-ISSN

1872-6771

Svazek periodika

336

Číslo periodika v rámci svazku

15 September 2023

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

10

Strana od-do

1-10

Kód UT WoS článku

001054239700001

EID výsledku v databázi Scopus

2-s2.0-85151307260