Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
Repository of the University of Ljubljana
Open Science Slovenia
Open Science
DiKUL
slv
|
eng
Search
Advanced
New in RUL
About RUL
In numbers
Help
Sign in
Details
Injective colorings of Sierpiński-like graphs and Kneser graphs
ID
Brešar, Boštjan
(
Author
),
ID
Klavžar, Sandi
(
Author
),
ID
Samadi, Babak
(
Author
),
ID
Yero, Ismael G.
(
Author
)
PDF - Presentation file,
Download
(6,22 MB)
MD5: D21BAADF835E56F2CB2819C89870B346
URL - Source URL, Visit
https://link.springer.com/article/10.1007/s00373-025-02952-3
Image galllery
Abstract
Two relationships between the injective chromatic number and, respectively, chromatic number and chromatic index, are proved. They are applied to determine the injective chromatic number of Sierpiński graphs and to give a short proof that Sierpiński graphs are Class 1. Sierpiński-like graphs are also considered, including generalized Sierpiński graphs over cycles and rooted products. It is proved that the injective chromatic number of a rooted product of two graphs lies in a set of six possible values. Sierpiński graphs and Kneser graphs $K(n,r)$ are considered with respect of being perfect injectively colorable, where a graph is perfect injectively colorable if it has an injective coloring in which every color class forms an open packing of largest cardinality. In particular, all Sierpiński graphs and Kneser graphs $K(n,r)$ with $n\ge 3r-1$, are perfect injectively colorable, while $K(7,3)$ is not.
Language:
English
Keywords:
injective coloring
,
injective chromatic number
,
perfect injectively colorable graph
,
Sierpiński graphs
,
Kneser graphs
,
rooted product graph
Work type:
Article
Typology:
1.01 - Original Scientific Article
Organization:
FMF - Faculty of Mathematics and Physics
Publication status:
Published
Publication version:
Version of Record
Publication date:
01.08.2025
Year:
2025
Number of pages:
22 str.
Numbering:
Vol. 41, iss. 4, art. no. 83
PID:
20.500.12556/RUL-170988
UDC:
519.17
ISSN on article:
0911-0119
DOI:
10.1007/s00373-025-02952-3
COBISS.SI-ID:
243802627
Publication date in RUL:
25.07.2025
Views:
169
Downloads:
61
Metadata:
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
Copy citation
Share:
Record is a part of a journal
Title:
Graphs and combinatorics
Shortened title:
Graphs comb.
Publisher:
Springer
ISSN:
0911-0119
COBISS.SI-ID:
25536512
Licences
License:
CC BY 4.0, Creative Commons Attribution 4.0 International
Link:
http://creativecommons.org/licenses/by/4.0/
Description:
This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.
Secondary language
Language:
Slovenian
Keywords:
injektivno barvanje
,
injektivno kromatično število
,
popolno injektivno obarljiv graf
,
grafi Sierpińskega
,
Kneserjevi grafi
,
korenski produkt grafov
Projects
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
P1-0297
Name:
Teorija grafov
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
N1-0285
Name:
Metrični problemi v grafih in hipergrafih
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
J1-4008
Name:
Drevesno neodvisnostno število grafov
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
N1-0355
Name:
Prirejanja, transverzale in hipergrafi
Funder:
Spanish Ministry of Science and Innovation
Project number:
PID2022-139543OB-C41
Similar documents
Similar works from RUL:
Similar works from other Slovenian collections:
Back