Cover Image

Connecting hypercube 1-factors

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hollom, Lawrence, Shaw, Benedict Randall
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05C70
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Uniformly balanced $H$-factors in multicoloured complete graphs
by: Banerjee, Agnijo, et al.
Published: (2026)

Completely independent spanning trees in the hypercube
by: Shaw, Benedict Randall
Published: (2024)

Hamiltonian laceability with a set of faulty edges in hypercubes
by: Ali, Abid, et al.
Published: (2025)

Hamiltonian paths extending a set of matchings in hypercubes
by: Ali, Abid, et al.
Published: (2025)

Minimal hypergraph non-jumps
by: Shaw, Benedict Randall
Published: (2025)

On graphs with maximum difference between game chromatic number and chromatic number
by: Hollom, Lawrence
Published: (2023)

A uniform bound on almost colour-balanced perfect matchings in colour-balanced cliques
by: Hollom, Lawrence
Published: (2024)

A note on monotonicity in Maker-Breaker graph colouring games
by: Hollom, Lawrence
Published: (2023)

Resonance graphs that are daisy cubes: from hypercubes to independent sets via resonant sets
by: Brezovnik, Simon, et al.
Published: (2024)

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

Strong binding numbers and factors
by: Chen, Guantao, et al.
Published: (2025)

Counterexamples to conjectures on strong maximality and minimality
by: Hollom, Lawrence, et al.
Published: (2025)

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

Sufficient conditions for even factors in graphs
by: Zhou, Sizhong, et al.
Published: (2025)

Spectral radius and k-factor-critical graphs
by: Zhou, Sizhong, et al.
Published: (2023)

Spectral radii and star-factors with large components
by: Sun, Zhiren, et al.
Published: (2026)

Signless Laplacian spectral conditions for even factors in graphs
by: Li, Lu, et al.
Published: (2025)

Two sufficient conditions for graphs to admit path factors
by: Zhou, Sizhong, et al.
Published: (2023)

Some sufficient conditions for graphs to have component factors
by: Zhou, Sizhong
Published: (2024)

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

Cubic factor-invariant graphs of bialternating cycle quotient type
by: Šparl, Primož
Published: (2026)

A spectral condition for a graph having a strong parity factor
by: Zhou, Sizhong, et al.
Published: (2024)

Packing coloring of hypercubes with extended Hamming codes
by: Gregor, Petr, et al.
Published: (2023)

A note on the number of non-cycle components in a pseudo 2-factor of graphs
by: Kashima, Masaki
Published: (2025)

Cycle-factors in oriented graphs
by: Wang, Zhilan, et al.
Published: (2024)

Balanced 1-Factorisations of 3- and 4-Regular Circulant Graphs
by: Mitchell, Jeremy
Published: (2024)

Aα-spectral radius and path-factor covered graphs
by: Zhou, Sizhong, et al.
Published: (2024)

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

The bunkbed conjecture is not robust to generalisation
by: Hollom, Lawrence
Published: (2024)

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

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

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

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

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

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

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

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

Two lower bounds for maximum matching
by: Kuyanov, Fedor
Published: (2024)

Grid designs
by: Danai, Alon, et al.
Published: (2026)

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