<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>On (r,g,χ)- graphs and cages of regularity r, girth g and chromatic number χ</dc:title><dc:creator>Araujo-Pardo,	Gabriela	(Avtor)
	</dc:creator><dc:creator>Díaz-Calderón,	Julio César	(Avtor)
	</dc:creator><dc:creator>Fresán-Figueroa,	Julián	(Avtor)
	</dc:creator><dc:creator>González-Moreno,	Diego	(Avtor)
	</dc:creator><dc:creator>Lesniak,	Linda	(Avtor)
	</dc:creator><dc:creator>Olsen,	Mika	(Avtor)
	</dc:creator><dc:subject>graphs</dc:subject><dc:subject>cages</dc:subject><dc:subject>girth</dc:subject><dc:subject>chromatic number</dc:subject><dc:description>For integers r ≥ 2, g ≥ 3 and χ ≥ 2, an (r, g, χ)-graph is an r-regular graph with girth g and chromatic number χ. Such a graph of minimum order is called an (r, g, χ)-cage. Here we prove the existence of (r, g, χ)-graphs for all r and even g when χ = 2 and for all r and g when χ = 3. Furthermore, using both existence proofs and explicit constructions we give examples of (r, g, χ)-graphs for infinitely many values of r, g, χ.</dc:description><dc:publisher>Založba Univerze na Primorskem</dc:publisher><dc:date>2025</dc:date><dc:date>2025-11-03 12:46:40</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>22079</dc:identifier><dc:identifier>UDK: 519.17</dc:identifier><dc:identifier>eISSN: 2590-9770</dc:identifier><dc:identifier>DOI: 10.26493/2590-9770.1737.0f8</dc:identifier><dc:language>sl</dc:language></metadata>
