:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Tang, Yunfang, Yao, Yuting
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2401.07254
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Proper conflict-free choosability of planar graphs
by: Wang, Yuting, et al.
Published: (2025)

Degree-truncated choosability of graphs
by: Zhou, Huan, et al.
Published: (2025)

Degree-truncated choosability of planar graphs
by: Jiang, Yiting, et al.
Published: (2024)

Weak diameter choosability of graphs with an excluded minor
by: Crouch, Joshua, et al.
Published: (2023)

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

All graphs are majority 3-choosable
by: Ouborny, Jan, et al.
Published: (2025)

On $\{1,2\}$-distance-balancedness of generalized Petersen graphs
by: Ma, Gang, et al.
Published: (2024)

Single conflict coloring, adaptable choosability and separation choosability
by: Casselgren, Carl Johan, et al.
Published: (2025)

The star edge coloring of cubic Halin graphs with star chromatic index $5$
by: Hu, Xingxing, et al.
Published: (2025)

Minimum non-chromatic-choosable graphs with given chromatic number
by: Zhu, Jialu, et al.
Published: (2022)

Star edge coloring of generalized Petersen graphs
by: Dastjerdi, Behnaz Omoomi Marzieh Vahid
Published: (2024)

Classification of perfect and total perfect codes in generalized Petersen graphs
by: Wang, Xiaomeng, et al.
Published: (2026)

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

Treewidth of generalized Hamming graph, bipartite Kneser graph and generalized Petersen graph
by: Wang, Yichen, et al.
Published: (2024)

Proper conflict-free degree-choosability of outerplanar graphs
by: Kashima, Masaki, et al.
Published: (2025)

Some results on total weight choosability
by: Wu, T., et al.
Published: (2024)

On the number of Hamiltonian cycles in the generalized Petersen graph
by: Haugland, Jan Kristian
Published: (2025)

Remarks on proper conflict-free degree-choosability of graphs with prescribed degeneracy
by: Kashima, Masaki, et al.
Published: (2025)

Degree-choosability of proper conflict-free list coloring of sparse graphs
by: Kashima, Masaki, et al.
Published: (2026)

Every graph is uniform-span $(2,2)$-choosable: Beyond the 1-2 conjecture
by: Deng, Kecai, et al.
Published: (2025)

Edge-coloring 4- and 5-regular projective planar graphs with no Petersen-minor
by: Kidner, Arnott, et al.
Published: (2025)

The square of every subcubic planar graph without 4-cycles and 5-cycles is 7-choosable
by: Jin, Ligang, et al.
Published: (2025)

Bipartite graphs are $(\frac{4}{5}-\varepsilon) \fracΔ{\log Δ}$-choosable
by: Bradshaw, Peter, et al.
Published: (2024)

The square of a subcubic planar graph without a 5-cycle is 7-choosable
by: Kim, Seog-Jin, et al.
Published: (2025)

Squares of subcubic planar graphs without cycles of length 4-8 are 6-choosable
by: Kim, Seog-Jin, et al.
Published: (2025)

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
by: Bastida, Sam, et al.
Published: (2026)

Parity-Dependent Real-Rootedness in Independence Polynomials of Generalized Petersen Graphs
by: Pandey, Rohan
Published: (2026)

Integral bases, perfect matchings, and the Petersen graph
by: Abdi, Ahmad, et al.
Published: (2025)

Non-solvable $2$-arc-transitive covers of Petersen graphs
by: Chen, Jiyong, et al.
Published: (2025)

Minimal abundant packings and choosability with separation
by: Furedi, Zoltan, et al.
Published: (2013)

On the Metric Dimension of Generalized Petersen Graphs $P(n,3)$
by: Gao, Rui, et al.
Published: (2025)

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

An Infinite Family of 6_Regular B-Cayley Graphs from the Petersen Graph
by: Anderson, Stuart E.
Published: (2026)

Graphs of maximum average degree less than $\frac {11}{3}$ are flexibly $4$-choosable
by: Bi, Richard, et al.
Published: (2024)

The minimum number of maximal independent sets in graphs with given order and independence number
by: Tian, Yuting, et al.
Published: (2024)

A closure for Hamilton-connectedness in $\{K_{1,3},Γ_3\}$-free graphs
by: Kabela, Adam, et al.
Published: (2024)

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

The linear Turán number of the 3-graph $P_5$
by: Tang, Chaoliang, et al.
Published: (2026)

Simplicial vs. cubical spheres, polyhedral products and the Nevo-Petersen conjecture
by: Limonchenko, Ivan, et al.
Published: (2024)

Generating graphs randomly
by: Greenhill, Catherine
Published: (2022)