:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Boyer, Geoffrey, Farrell, Garrett C., Goddard, Wayne
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2509.11857
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Bounds on Independent Isolation in Graphs
by: Boyer, Geoffrey, et al.
Published: (2025)

Disjoint Isolating Sets and Graphs with Maximum Isolation Number
by: Boyer, Geoffrey, et al.
Published: (2024)

On the Toughness of Regular Graphs and Prisms
by: Boyer, Geoffrey, et al.
Published: (2023)

Bounds on Coloring Trees without Rainbow Paths
by: Goddard, Wayne, et al.
Published: (2025)

On the isolation number of graphs with minimum degree four
by: Goddard, Wayne, et al.
Published: (2025)

A Note on Distance-Fall Colorings
by: Goddard, Wayne, et al.
Published: (2025)

A Note on One-Hole Domino Tilings of Squares and Rectangles
by: Byun, Seok Hyun, et al.
Published: (2025)

The k-general d-position problem for graphs
by: Cody, Brent, et al.
Published: (2024)

Rational parking functions and $(m, n)$-invariant sets
by: Nelson, Garrett
Published: (2025)

Well-hued graphs with first difference two
by: Boyer, Geoffrey, et al.
Published: (2025)

Super-minimally $3$-connected graphs
by: Ge, Wayne
Published: (2025)

Independent Domination of k-Trees
by: Pham, Andrew
Published: (2024)

Unavoidable cycle-contraction minors of large $2$-connected graphs
by: Ge, Wayne, et al.
Published: (2025)

On the Steiner $k$-diameter and Steiner ($k,k^{\prime}$)-radius of trees
by: Zhang, Qingnan, et al.
Published: (2025)

On the $(k+2,k)$-problem of Brown, Erdős and Sós for even integers $k$
by: Wang, Yan, et al.
Published: (2026)

List colorings of $k$-partite $k$-graphs
by: Dhawan, Abhishek
Published: (2023)

On the $(k+2,k)$-problem of Brown, Erdős and Sós for $k=5,6,7$
by: Glock, Stefan, et al.
Published: (2024)

A combinatorial proof of a relationship between maximal $(2k-1,2k+1)$ and $(2k-1,2k,2k+1)$-cores
by: Nath, Rishi, et al.
Published: (2015)

On bipartite $(1,1,k)$-mixed graphs
by: Dalfó, C., et al.
Published: (2024)

Settling the no-$(k+1)$-in-line problem when $k$ is not small
by: Kovács, Benedek, et al.
Published: (2025)

k-non-crossing trees and edge statistics modulo k
by: Prodinger, Helmut
Published: (2024)

Symmetric $(2^k-1,2^{k-1},2^{k-2})$-designs which are $(2^{k-1}-1)$-pyramidal over abelian groups
by: Pankov, Mark
Published: (2025)

Sums of $k$-bonacci Numbers
by: Parks, Harold R., et al.
Published: (2022)

Enumeration of Nondegenerate $2 \times (k+1) \times k$ Hypermatrices
by: Koprowski, Brandon, et al.
Published: (2026)

List-$k$-Coloring $H$-free graphs for all $k>4$
by: Chudnovsky, Maria, et al.
Published: (2023)

Isolation of regular graphs and $k$-chromatic graphs
by: Borg, Peter
Published: (2023)

On the minimum degree of minimal $k$-$\{1,2\}$-factor critical $k$-planar graphs
by: Pereyra, Kevin
Published: (2026)

The Erdős-Faudree Problems and the Isolate-Free Core
by: Mao, Yaping
Published: (2026)

Deduction with $k$ moves
by: Burgess, Andrea C., et al.
Published: (2025)

Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More
by: Korhonen, Tuukka
Published: (2024)

The Strong Nine Dragon Tree Conjecture is True for $d \leq 2(k+1)$
by: Mies, Sebastian, et al.
Published: (2024)

On the perfect $k$-divisibility of graphs
by: Scholz, David
Published: (2025)

The quantum k-Bruhat order
by: Colmenarejo, Laura, et al.
Published: (2026)

Inequalities for $k$-regular partitions
by: Heim, Bernhard, et al.
Published: (2024)

The Gapped $k$-Deck Problem
by: Golm, Jonas, et al.
Published: (2022)

$k$-Adjoint of Hyperplane Arrangements
by: Liang, Weikang, et al.
Published: (2024)

Monochromatic $k$-connection of graphs
by: Cai, Qingqiong, et al.
Published: (2024)

On the $k$-anti-traceability Conjecture
by: Chen, Bin, et al.
Published: (2024)

A parking function interpretation for $(-1)^{k}\nabla m_{2^{k}1^{l}}$
by: Qu, Menghao, et al.
Published: (2023)

Sufficient conditions for fractional $k$-factor-critical graphs with minimum degree to be $k$-factor-critical
by: Zhong, Jiaxu, et al.
Published: (2026)