Cover Image

The Hamiltonian properties of rectangular meshes with at most two faulty nodes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Xie, Yingtai
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

All Graphs with at most 8 nodes are 2-interval-PCGs
by: Calamoneri, Tiziana, et al.
Published: (2022)

Every 2-connected, cubic, planar graph with faces of size at most 6 is Hamiltonian
by: Shao, Sihong, et al.
Published: (2025)

Chvátal-Erdős condition for 2-factors with at most two components in graphs
by: Tian, Tao, et al.
Published: (2026)

A concentration phenomenon for $h$-extra edge-connectivity reliability analysis of enhanced hypercubes $Q_{n,2}$ with exponentially many faulty links
by: Sun, Yali, et al.
Published: (2024)

Identifying faulty edges in resistive electrical networks
by: Fiedorowicz, Barbara, et al.
Published: (2025)

Excluding a rectangular grid
by: Rambaud, Clément
Published: (2025)

A bijection between evil-avoiding and rectangular permutations
by: Tung, Katherine
Published: (2023)

Existence of most reliable two-terminal graphs with distance constraints
by: Romero, Pablo
Published: (2025)

Equidistribution of mesh patterns of short length
by: Su, Xinyu, et al.
Published: (2026)

Singleton mesh patterns in multidimensional permutations
by: Avgustinovich, Sergey, et al.
Published: (2022)

A two-steps tensor eigenvector centrality for nodes and hyperedges in hypergraphs
by: Xu, Qing, et al.
Published: (2026)

Existence, uniqueness and construction of locally most reliable two-terminal graphs
by: Romero, Pablo
Published: (2025)

Words avoiding the morphic images of most of their factors
by: Ochem, Pascal, et al.
Published: (2025)

Bounding the number of holes required for folding rectangular polyominoes into cubes
by: Lehner, Florian, et al.
Published: (2025)

Hermitian adjacency matrices with at most three distinct eigenvalues
by: Akbari, Saieed, et al.
Published: (2025)

On (joint) equidistributions of mesh patterns 123 and 132 with symmetric shadings
by: Kitaev, Sergey, et al.
Published: (2024)

Strong list-chromatic index of subcubic graphs is at most 10
by: Tang, Yunfang, et al.
Published: (2025)

Optimal radio labeling for the Cartesian product of square mesh networks and stars
by: Cui, Linlin, et al.
Published: (2024)

Extreme singular values of inhomogeneous sparse random rectangular matrices
by: Dumitriu, Ioana, et al.
Published: (2022)

The minimum number of distinct eigenvalues of a threshold graph is at most $4$
by: Allem, Luiz Emilio, et al.
Published: (2025)

Extremal digraphs containing at most $t$ paths of length 2 with the same endpoints
by: Huang, Zejun, et al.
Published: (2024)

A characterization of graphs of radius-$r$ flip-width at most $2$
by: Chang, Yeonsu, et al.
Published: (2023)

On fourteen equidistribution conjectures of Lv and Zhang and monotone mesh patterns with corner shadings
by: Fang, Qi, et al.
Published: (2025)

Kneser graphs are Hamiltonian
by: Merino, Arturo, et al.
Published: (2022)

A labeling of the Simplex-Lattice Hypergraph with at most 2 colors on each hyperedge
by: Papaz, Ognjen, et al.
Published: (2025)

Between proper and square colorings of planar graphs with maximum degree at most four
by: Liu, Xujun, et al.
Published: (2026)

Orientations of graphs with at most one directed path between every pair of vertices
by: Dohnalová, Barbora, et al.
Published: (2024)

The most probable order of a random permutation
by: Beker, Adrian
Published: (2025)

Totally $Δ$-modular IPs with two non-zeros in most rows
by: Kober, Stefan
Published: (2024)

$K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two
by: Chakraborty, Dibyayan
Published: (2025)

On the Polytope Model and Near End node Isomorphisms of Type $A$ Kirillov--Reshetikhin Crystals
by: Biswas, Dipnit, et al.
Published: (2025)

Ramanujan graphs with diameter at most three
by: Ebrahimi, Mahdi
Published: (2024)

A refined lower bound theorem for $d$-polytopes with at most $2d$ vertices
by: Pineda-Villavicencio, Guillermo, et al.
Published: (2025)

$s$-Stable Kneser Graph are Hamiltonian
by: Ledezma, Agustina V., et al.
Published: (2024)

On $2$-factors of Hamiltonian graphs
by: Díaz, Alberto Espuny, et al.
Published: (2026)

Kneser Graphs of Triangulations are Hamiltonian
by: Molnar, Anton, et al.
Published: (2026)

About subspaces the most deviating from the coordinate ones
by: Nesterenko, Yuri
Published: (2025)

Packing chromatic critical graphs with radius at most 2
by: Gür, Aslıhan, et al.
Published: (2026)

4K_1 free graphs on 13 vertices have cop number at most 2
by: Wu, Zhaoyu
Published: (2026)