:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autor principal:	Mitchell, Jeremy
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics 05C70
Acceso en línea:	https://arxiv.org/abs/2411.19197
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Characterization of Equimatchable Even-Regular Graphs
por: Zhao, Xiao, et al.
Publicado: (2024)

Neighborhood Balanced 3-Coloring
por: Minyard, Mitchell, et al.
Publicado: (2024)

Balanced Domination in Convex Polytopes, Trees, and Grid Graphs
por: Nikolic, Bojan, et al.
Publicado: (2025)

An updated survey on 2-Factors of Regular Graphs
por: Labbate, D., et al.
Publicado: (2024)

Cycle Partitions in Dense Regular Digraphs and Oriented Graphs
por: Lo, Allan, et al.
Publicado: (2023)

Regular colouring defect of a cubic graph and the conjectures of Fan-Raspaud and Fulkerson
por: Karabáš, Ján, et al.
Publicado: (2023)

The Minimum Number of Edges in $(p+1)K_2$-Saturated Graphs
por: Zhou, Xiaoteng, et al.
Publicado: (2025)

Odd Covers of Complete Graphs and Hypergraphs
por: Leader, Imre, et al.
Publicado: (2024)

2-Factors in Graphs
por: Heuvel, Jan van den, et al.
Publicado: (2025)

Tight Bounds on the Chromatic Edge Stability Index of Graphs
por: Akbari, Saieed, et al.
Publicado: (2022)

A Discrete Logarithm Construction for Orthogonal Double Covers of the Complete Graph by Hamiltonian Paths
por: Ollis, M. A.
Publicado: (2025)

On the k-spanning cyclability of 4-valent Cayley graphs on Abelian groups
por: Alspach, Brian, et al.
Publicado: (2024)

On removable edge subsets in graphs with a nowhere-zero $4$-flow
por: Mattiolo, Davide
Publicado: (2025)

An Aα-spectral radius for the existence of {P3, P4, P5}-factors in graphs
por: Zhang, Yuli, et al.
Publicado: (2025)

Connecting hypercube 1-factors
por: Hollom, Lawrence, et al.
Publicado: (2025)

Optimal decomposition of $K_{18}$ and $K_{19}$ into $K_3$ and $K_4$
por: Kovář, Petr, et al.
Publicado: (2025)

Three-cuts are a charm: acyclicity in 3-connected cubic graphs
por: Kardoš, František, et al.
Publicado: (2023)

Spanning plane subgraphs of $1$-plane graphs
por: Noguchi, Kenta, et al.
Publicado: (2024)

Adjacency spectral radius and H-factors in 1-binding graphs
por: Zhou, Sizhong, et al.
Publicado: (2025)

Perfect matchings and $A_α$-spectral radius in 1-binding graphs
por: Zhou, Sizhong, et al.
Publicado: (2026)

The Linear Arboricity Conjecture for Graphs with Large Girth
por: Mishra, Tapas Kumar
Publicado: (2025)

Sufficient conditions for a graph with minimum degree to be k-critical with respect to [1,b]-odd factor
por: Zhou, Sizhong
Publicado: (2025)

On essentially 4-edge-connected cubic bricks
por: Kothari, Nishad, et al.
Publicado: (2018)

On the number of triangles in $K_4$-free graphs
por: He, Jialin, et al.
Publicado: (2025)

Cup Stacking in Graphs
por: Fay, Paul, et al.
Publicado: (2023)

Measurable Regular Subgraphs
por: Bowen, Matt, et al.
Publicado: (2024)

A SAT-based Filtering Framework for Exact Coverings of K33 by Cliques of Order 3, 4 or 5
por: Kovař, Petr, et al.
Publicado: (2026)

Graphs missing a connected partition
por: Tom, Foster
Publicado: (2024)

Spanning k-trees, odd [1,b]-factors and spectral radius in binding graphs
por: Wu, Jiancheng, et al.
Publicado: (2025)

On $4$-covers of cubic graphs with two adjacent odd circuits in a $2$-factor
por: Karabáš, Ján, et al.
Publicado: (2026)

Disjoint Correspondence Colorings for $K_5$-Minor-free Graphs
por: van Batenburg, Wouter Cames, et al.
Publicado: (2026)

Paired $(n-1)$-to-$(n-1)$ disjoint path covers in bipartite transposition-like graphs
por: Coleman, Anna, et al.
Publicado: (2024)

Two lower bounds for maximum matching
por: Kuyanov, Fedor
Publicado: (2024)

A stability result for almost perfect matchings
por: Guo, Mingyang, et al.
Publicado: (2024)

Grid designs
por: Danai, Alon, et al.
Publicado: (2026)

Almost-perfect colorful matchings in three-edge-colored bipartite graphs
por: Boyadzhiyska, Simona, et al.
Publicado: (2025)

Generating simple near-bipartite bricks
por: Kothari, Nishad, et al.
Publicado: (2017)

Covering the edges of a graph with perfect matchings
por: Silina, Olha
Publicado: (2023)

Tight Bounds for Cycle-Edge Decompositions and Covers
por: Akbari, Saieed, et al.
Publicado: (2025)

Strong binding numbers and factors
por: Chen, Guantao, et al.
Publicado: (2025)