| Title: | On criticality and additivity of the pseudoachromatic number under join |
|---|
| Authors: | ID Meddaugh, Jonathan (Author)
ID Sepanski, Mark R. (Author)
ID Venkataraman, Yegnanarayanan (Author) |
|---|
| Files: |  AMC_Meddaugh,_Sepanski,_Venkataraman_2026.pdf (354,12 KB)
MD5: B1F91C6A991C017A7914EFA1B2FF80F9
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | ZUP - University of Primorska Press
|
|---|
| Abstract: | 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. |
|---|
| Keywords: | pseudocomplete, pseudoachromatic number, critical, weakly critical, join |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 25.02.2026 |
|---|
| Publisher: | Založba Univerze na Primorskem |
|---|
| Year of publishing: | 2026 |
|---|
| Number of pages: | 15 str. |
|---|
| Numbering: | Vol. 26, no. 2, [article no.] P2.06 |
|---|
| PID: | 20.500.12556/RUP-23435  |
|---|
| UDC: | 51 |
|---|
| eISSN: | 1855-3974 |
|---|
| DOI: | 10.26493/1855-3974.3475.83e |
|---|
| Publication date in RUP: | 11.08.2026 |
|---|
| Views: | 78 |
|---|
| Downloads: | 2 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
