Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 1
ǂA ǂremark on a result on odd colorings of planar graphs
Dinabandhu Pradhan, Vaishali Sharma, Riste Škrekovski
Izvirni znanstveni članek
Oznake: coloring;odd coloring;planar graphs;
A proper ▫$k$▫-coloring of a graph is said to be odd if every non-isolated vertex has a color that appears an odd number of times on its neighborhood. Miao et al. (2024) [2] claimed that every planar graph without adjacent ▫$3$▫-cycles is odd ▫$7$▫-colorable and every triangle-free planar graph with ...
Leto: 2026 Vir: Fakulteta za matematiko in fiziko (UL FMF)
Št. zadetkov: 1
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: