Image de couverture de livre

Covering and 2-degree-packing numbers in graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Montufar, Carlos Alfaro, Montiel, Christian Rubio, Vázquez-Ávila, Adrián
Format:	Preprint
Publié:	2017
Sujets:	Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Extremal regular graphs of given chromatic number
par: Rubio-Montiel, Christian
Publié: (2019)

List packing number of bounded degree graphs
par: Cambie, Stijn, et autres
Publié: (2023)

On independent domination and packing numbers of subcubic graphs
par: Bai, Xuqing, et autres
Publié: (2024)

The 2-switch-degree of a graph
par: Schvöllner, Victor N., et autres
Publié: (2025)

On the harmonious chromatic number of graphs
par: Araujo-Pardo, Gabriela, et autres
Publié: (2022)

The oriented chromatic number of random graphs of bounded degree
par: Gunderson, Karen, et autres
Publié: (2022)

The maximum number of cliques in graphs with given fractional matching number and minimum degree
par: Li, Chengli, et autres
Publié: (2024)

Cover numbers by certain graph families
par: Marits, Márton
Publié: (2024)

The circumference of a graph with given minimum degree and clique number
par: Chen, Na, et autres
Publié: (2025)

On graphs with chromatic number and maximum degree both equal to nine
par: Galindo, Rachel, et autres
Publié: (2024)

Ramsey numbers of bounded degree trees versus general graphs
par: Montgomery, Richard, et autres
Publié: (2023)

A linear upper bound on the $\mathbb{Z}_p$-Ramsey number of graphs with sufficiently large $2$-packing
par: Heath, Emily, et autres
Publié: (2026)

On the dib-chromatic number of a digraph
par: Montellano-Ballesteros, Juan José, et autres
Publié: (2025)

On the isolation number of graphs with minimum degree four
par: Goddard, Wayne, et autres
Publié: (2025)

Odd and even cycle lengths, minimum degree and chromatic number in graphs
par: Wang, Xiaolin
Publié: (2025)

Clique packings in random graphs
par: Griffiths, Simon, et autres
Publié: (2024)

Triangle packings in randomly perturbed graphs
par: Cheng, Xinbu, et autres
Publié: (2026)

$S$-packing chromatic vertex-critical graphs
par: Holub, Přemysl, et autres
Publié: (2020)

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
par: Bonamy, Marthe, et autres
Publié: (2022)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
par: Botler, Fábio, et autres
Publié: (2025)

Ordered Yao graphs: maximum degree, edge numbers, and clique numbers
par: Ágoston, Péter, et autres
Publié: (2025)

On the $(1^2,2^4)$-packing edge-coloring of subcubic graphs
par: Liu, Xujun, et autres
Publié: (2024)

The dib-chromatic number of digraphs
par: Javier-Nol, Nahid, et autres
Publié: (2024)

Zykov sums of digraphs with diachromatic number equal to their harmonious number
par: Olsen, Mika, et autres
Publié: (2022)

List packing of graphs with bounded tree-width
par: Kashima, Masaki, et autres
Publié: (2026)

On $(1^2,2^2)$-packing edge-coloring of sparse subcubic graphs
par: Liu, Xujun, et autres
Publié: (2026)

Edge density and minimum degree thresholds for $H$-free graphs with unbounded chromatic number
par: Wu, Zhuo, et autres
Publié: (2025)

A linear upper bound for zero-sum Ramsey numbers of bounded degree graphs
par: Katz, Jasmin, et autres
Publié: (2025)

On Sierpiński packing chromatic number and recognition of Sierpiński products
par: Holub, Přemysl, et autres
Publié: (2025)

Every connected subcubic graph except the Petersen graph is packing $(1,1,2,2)$-colorable
par: Hou, Xinmin, et autres
Publié: (2026)

Corrections to classical results on Independence and Covering numbers of the Splitting graph
par: Castro, J., et autres
Publié: (2026)

Every subcubic graph is packing $(1,1,2,2,3)$-colorable
par: Liu, Xujun, et autres
Publié: (2024)

Maximizing subgraph density in graphs of bounded degree and clique number
par: Kirsch, Rachel
Publié: (2025)

Approximate packing of independent transversals in locally sparse graphs
par: Chakraborti, Debsoumya, et autres
Publié: (2024)

Maximum packings in graphs forbidding given rainbow cycles
par: Li, Ping, et autres
Publié: (2026)

On $d$-distance $p$-packing domination number in strong products
par: Bujtás, Csilla, et autres
Publié: (2025)

Banff designs: difference methods for coloring incidence graphs
par: Buratti, Marco, et autres
Publié: (2023)

Biclique immersions in graphs with independence number 2
par: Botler, Fábio, et autres
Publié: (2023)

Normal approximation of the numbers of isolated edges and isolated 2-stars in uniform simple graphs with given vertex degrees
par: Imai, Ryo
Publié: (2026)

Equating three degrees of graphs
par: Liu, Zhen, et autres
Publié: (2025)