:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Shao, Sihong, Wu, Yuxuan
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2504.20706
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Eulerian-spanning set and coboundary operator: An investigation of maxcut beyond planar graphs
by: Fang, Qiming, et al.
Published: (2026)

4-connected 1-planar chordal graphs are Hamiltonian-connected
by: Zhang, Licheng, et al.
Published: (2024)

A note on cycles in cyclically $4$-edge-connected cubic planar graphs
by: Lo, On-Hei Solomon
Published: (2026)

Two classes of connectivity-related non-Hamiltonian 1-planar perfect graphs
by: Zhang, Licheng, et al.
Published: (2024)

Dense $2$-connected planar graphs and the planar Turán number of $2C_k$
by: Li, Ping
Published: (2025)

Every connected subcubic graph except the Petersen graph is packing $(1,1,2,2)$-colorable
by: Hou, Xinmin, et al.
Published: (2026)

Every $3$-connected $\{K_{1,3},Γ_3\}$-free graph is Hamilton-connected
by: Kabela, Adam, et al.
Published: (2024)

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

On 2-distance 16-coloring of planar graphs with maximum degree at most five
by: Deniz, Zakir
Published: (2023)

Equivalent spectral theory for fundamental graph cut problems
by: Shao, Sihong, et al.
Published: (2024)

Ore's Theorem for rainbow Hamiltonian-connected graphs
by: Li, Yupei, et al.
Published: (2025)

The number of cut-edges and conflict-free connection number in planar graphs
by: Ha, Pham Hoang, et al.
Published: (2026)

The maximum number of $k$-cliques of 7-connected 1-planar graphs
by: Huang, Yuanqiu, et al.
Published: (2026)

Hamiltonian connectivity of some base-cobase graphs
by: Martínez-Sandoval, Leonardo, et al.
Published: (2025)

Every graph with no $K_7^{\vee}$-minor is $6$-colorable
by: Norin, Sergey, et al.
Published: (2025)

A High-Dimensional Extension of Wagner's Theorem and the Geometrization of Hypergraphs
by: Fang, Qiming, et al.
Published: (2025)

Bouchet's conjecture for cyclically 5-edge-connected, cubic signed graphs
by: Nurse, Kathryn
Published: (2026)

Pancyclicity of almost-planar graphs
by: Adams, Santiago T., et al.
Published: (2024)

Every 3-connected $\{K_{1,4},K_{1,4}+e\}$-free split graph of order at least 13 is Hamilton-connected
by: Tian, Tao, et al.
Published: (2026)

Every connected graph admits a local antimagic orientation and almost every graph admits an antimagic orientation
by: Dhananjaya, Eranda, et al.
Published: (2024)

Every signed planar graph is $5$-choosable: A short proof and refinements
by: Atangana, Pie Desire Ebode, et al.
Published: (2026)

A simple inverse power method for balanced graph cut
by: Shao, Sihong, et al.
Published: (2024)

On the girth and connectivity of cubic graphs with a unique longest cycle
by: Jooken, Jorik, et al.
Published: (2024)

Near-perfect matchings in highly connected 1-planar graphs with a local crossing constraint
by: Ouyang, Licheng Zhang Yuanqiu Huang Zhangdong
Published: (2026)

Hilbert basis in the face-centered cubic grid -- mathematical proofs
by: Vizvari, Bela, et al.
Published: (2025)

Connected triangle-free planar graphs whose second largest eigenvalue is at most 1
by: Cheng, Kun, et al.
Published: (2024)

Normal 6-edge-colorings of cubic graphs with oddness 2
by: Fabrici, Igor, et al.
Published: (2025)

$2$-limited broadcast domination in cubic graphs
by: Choi, Myungho, et al.
Published: (2026)

An ODE approach to multiple choice polynomial programming
by: Shao, Sihong, et al.
Published: (2022)

$λ$-matchability in cubic graphs
by: Raghul, Santhosh, et al.
Published: (2025)

Nice vertices in cubic graphs
by: Chen, Wuxian, et al.
Published: (2025)

Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
by: Dailly, Antoine, et al.
Published: (2025)

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

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

Partitions of planar (oriented) graphs into a connected acyclic and an independent set
by: Cambie, Stijn, et al.
Published: (2024)

Cayley graphs of order 6pq are Hamiltonian
by: Maghsoudi, Farzad
Published: (2020)

A note on optimal 2-planar graphs
by: Zhang, Licheng, et al.
Published: (2025)

Every subcubic graph is packing $(1,1,2,2,3)$-colorable
by: Liu, Xujun, et al.
Published: (2024)

Every $2k$-connected $(P_2\cup kP_1)$-free graph with toughness greater than one is hamiltonian-connected
by: Liu, Feng
Published: (2025)

Small planar hypohamiltonian graphs
by: Tsai, Cheng-Chen
Published: (2024)