Iskanje po repozitoriju

Opis: A vertex coloring of a graph is said to be pseudocomplete if, for any two distinct colors, there exists at least one edge with those two colors as its end vertices. The pseudoachromatic number of a graph is the greatest number of colors possible used in a pseudocomplete coloring. This paper studies properties relating to additivity of the pseudoachromatic number under the join. Errors from the literature are corrected and the notion of weakly critical is introduced in order to study the problem.
Ključne besede: pseudocomplete, pseudoachromatic number, critical, weakly critical, join
Objavljeno v RUP: 11.08.2026; Ogledov: 325; Prenosov: 14
Celotno besedilo (354,12 KB)