Image de couverture de livre

Connecting hypercube 1-factors

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hollom, Lawrence, Shaw, Benedict Randall
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics 05C70
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Uniformly balanced $H$-factors in multicoloured complete graphs
par: Banerjee, Agnijo, et autres
Publié: (2026)

Completely independent spanning trees in the hypercube
par: Shaw, Benedict Randall
Publié: (2024)

Hamiltonian laceability with a set of faulty edges in hypercubes
par: Ali, Abid, et autres
Publié: (2025)

Hamiltonian paths extending a set of matchings in hypercubes
par: Ali, Abid, et autres
Publié: (2025)

Minimal hypergraph non-jumps
par: Shaw, Benedict Randall
Publié: (2025)

On graphs with maximum difference between game chromatic number and chromatic number
par: Hollom, Lawrence
Publié: (2023)

A uniform bound on almost colour-balanced perfect matchings in colour-balanced cliques
par: Hollom, Lawrence
Publié: (2024)

A note on monotonicity in Maker-Breaker graph colouring games
par: Hollom, Lawrence
Publié: (2023)

Resonance graphs that are daisy cubes: from hypercubes to independent sets via resonant sets
par: Brezovnik, Simon, et autres
Publié: (2024)

Adjacency spectral radius and H-factors in 1-binding graphs
par: Zhou, Sizhong, et autres
Publié: (2025)

Strong binding numbers and factors
par: Chen, Guantao, et autres
Publié: (2025)

Counterexamples to conjectures on strong maximality and minimality
par: Hollom, Lawrence, et autres
Publié: (2025)

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

Sufficient conditions for even factors in graphs
par: Zhou, Sizhong, et autres
Publié: (2025)

Spectral radius and k-factor-critical graphs
par: Zhou, Sizhong, et autres
Publié: (2023)

Spectral radii and star-factors with large components
par: Sun, Zhiren, et autres
Publié: (2026)

Signless Laplacian spectral conditions for even factors in graphs
par: Li, Lu, et autres
Publié: (2025)

Two sufficient conditions for graphs to admit path factors
par: Zhou, Sizhong, et autres
Publié: (2023)

Some sufficient conditions for graphs to have component factors
par: Zhou, Sizhong
Publié: (2024)

Spanning k-trees, odd [1,b]-factors and spectral radius in binding graphs
par: Wu, Jiancheng, et autres
Publié: (2025)

Cubic factor-invariant graphs of bialternating cycle quotient type
par: Šparl, Primož
Publié: (2026)

A spectral condition for a graph having a strong parity factor
par: Zhou, Sizhong, et autres
Publié: (2024)

Packing coloring of hypercubes with extended Hamming codes
par: Gregor, Petr, et autres
Publié: (2023)

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

Cycle-factors in oriented graphs
par: Wang, Zhilan, et autres
Publié: (2024)

Balanced 1-Factorisations of 3- and 4-Regular Circulant Graphs
par: Mitchell, Jeremy
Publié: (2024)

Aα-spectral radius and path-factor covered graphs
par: Zhou, Sizhong, et autres
Publié: (2024)

Spanning plane subgraphs of $1$-plane graphs
par: Noguchi, Kenta, et autres
Publié: (2024)

The bunkbed conjecture is not robust to generalisation
par: Hollom, Lawrence
Publié: (2024)

The Minimum Number of Edges in $(p+1)K_2$-Saturated Graphs
par: Zhou, Xiaoteng, et autres
Publié: (2025)

Perfect matchings and $A_α$-spectral radius in 1-binding graphs
par: Zhou, Sizhong, et autres
Publié: (2026)

On $4$-covers of cubic graphs with two adjacent odd circuits in a $2$-factor
par: Karabáš, Ján, et autres
Publié: (2026)

An Aα-spectral radius for the existence of {P3, P4, P5}-factors in graphs
par: Zhang, Yuli, et autres
Publié: (2025)

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

Almost-perfect colorful matchings in three-edge-colored bipartite graphs
par: Boyadzhiyska, Simona, et autres
Publié: (2025)

Tight Bounds for Cycle-Edge Decompositions and Covers
par: Akbari, Saieed, et autres
Publié: (2025)

Odd Covers of Complete Graphs and Hypergraphs
par: Leader, Imre, et autres
Publié: (2024)

Two lower bounds for maximum matching
par: Kuyanov, Fedor
Publié: (2024)

Grid designs
par: Danai, Alon, et autres
Publié: (2026)

Generating simple near-bipartite bricks
par: Kothari, Nishad, et autres
Publié: (2017)