:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Montufar, Carlos Alfaro, Montiel, Christian Rubio, Vázquez-Ávila, Adrián
Format:	Preprint
Published:	2017
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/1707.02254
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Extremal regular graphs of given chromatic number
by: Rubio-Montiel, Christian
Published: (2019)

List packing number of bounded degree graphs
by: Cambie, Stijn, et al.
Published: (2023)

On independent domination and packing numbers of subcubic graphs
by: Bai, Xuqing, et al.
Published: (2024)

On the harmonious chromatic number of graphs
by: Araujo-Pardo, Gabriela, et al.
Published: (2022)

The 2-switch-degree of a graph
by: Schvöllner, Victor N., et al.
Published: (2025)

On the dib-chromatic number of a digraph
by: Montellano-Ballesteros, Juan José, et al.
Published: (2025)

Zykov sums of digraphs with diachromatic number equal to their harmonious number
by: Olsen, Mika, et al.
Published: (2022)

The dib-chromatic number of digraphs
by: Javier-Nol, Nahid, et al.
Published: (2024)

The oriented chromatic number of random graphs of bounded degree
by: Gunderson, Karen, et al.
Published: (2022)

The maximum number of cliques in graphs with given fractional matching number and minimum degree
by: Li, Chengli, et al.
Published: (2024)

Ordered Yao graphs: maximum degree, edge numbers, and clique numbers
by: Ágoston, Péter, et al.
Published: (2025)

Cover numbers by certain graph families
by: Marits, Márton
Published: (2024)

The circumference of a graph with given minimum degree and clique number
by: Chen, Na, et al.
Published: (2025)

On graphs with chromatic number and maximum degree both equal to nine
by: Galindo, Rachel, et al.
Published: (2024)

Ramsey numbers of bounded degree trees versus general graphs
by: Montgomery, Richard, et al.
Published: (2023)

On the isolation number of graphs with minimum degree four
by: Goddard, Wayne, et al.
Published: (2025)

Banff designs: difference methods for coloring incidence graphs
by: Buratti, Marco, et al.
Published: (2023)

A linear upper bound on the $\mathbb{Z}_p$-Ramsey number of graphs with sufficiently large $2$-packing
by: Heath, Emily, et al.
Published: (2026)

Clique packings in random graphs
by: Griffiths, Simon, et al.
Published: (2024)

Acyclic and complete coloring of digraphs with the minimum and maximum possible numbers of colors
by: Olsen, Mika, et al.
Published: (2025)

Triangle packings in randomly perturbed graphs
by: Cheng, Xinbu, et al.
Published: (2026)

$S$-packing chromatic vertex-critical graphs
by: Holub, Přemysl, et al.
Published: (2020)

Odd and even cycle lengths, minimum degree and chromatic number in graphs
by: Wang, Xiaolin
Published: (2025)

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
by: Bonamy, Marthe, et al.
Published: (2022)

On Grundy indices for complete geometric graphs
by: Lara, Dolores, et al.
Published: (2025)

Genetic algorithm and edge-colorings of complete graphs with connected classes
by: Cervantes-Ojeda, Jorge, et al.
Published: (2024)

A sharp upper bound for the harmonious total chromatic number of graphs and multigraphs
by: Abreu, M., et al.
Published: (2024)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
by: Botler, Fábio, et al.
Published: (2025)

List packing of graphs with bounded tree-width
by: Kashima, Masaki, et al.
Published: (2026)

On the $(1^2,2^4)$-packing edge-coloring of subcubic graphs
by: Liu, Xujun, et al.
Published: (2024)

Maximizing subgraph density in graphs of bounded degree and clique number
by: Kirsch, Rachel
Published: (2025)

On Sierpiński packing chromatic number and recognition of Sierpiński products
by: Holub, Přemysl, et al.
Published: (2025)

On $(1^2,2^2)$-packing edge-coloring of sparse subcubic graphs
by: Liu, Xujun, et al.
Published: (2026)

Edge density and minimum degree thresholds for $H$-free graphs with unbounded chromatic number
by: Wu, Zhuo, et al.
Published: (2025)

A linear upper bound for zero-sum Ramsey numbers of bounded degree graphs
by: Katz, Jasmin, et al.
Published: (2025)

Every connected subcubic graph except the Petersen graph is packing $(1,1,2,2)$-colorable
by: Hou, Xinmin, et al.
Published: (2026)

Domination and packing in graphs
by: Dúcz, Ákos, et al.
Published: (2026)

Independence numbers of the 2-token graphs of some join graphs
by: Rivera, Luis Manuel, et al.
Published: (2025)

Every subcubic graph is packing $(1,1,2,2,3)$-colorable
by: Liu, Xujun, et al.
Published: (2024)

Approximate packing of independent transversals in locally sparse graphs
by: Chakraborti, Debsoumya, et al.
Published: (2024)