Imagen de Portada

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

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Xie, Yingtai
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

Excluding a rectangular grid
por: Rambaud, Clément
Publicado: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Kneser graphs are Hamiltonian
por: Merino, Arturo, et al.
Publicado: (2022)

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

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

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

The most probable order of a random permutation
por: Beker, Adrian
Publicado: (2025)

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

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

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

Ramanujan graphs with diameter at most three
por: Ebrahimi, Mahdi
Publicado: (2024)

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

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

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

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

About subspaces the most deviating from the coordinate ones
por: Nesterenko, Yuri
Publicado: (2025)

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

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