:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Schlomberg, Niklas
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2404.17813
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improved Erdős-Pósa inequalities for odd cycles in planar graphs
by: Puhlmann, Luise, et al.
Published: (2025)

Expansion of gap-planar graphs
by: Wood, David R.
Published: (2025)

Note on the treewidth of graphs excluding a disjoint union of cycles as a minor
by: Joret, Gwenaël, et al.
Published: (2026)

Edge-disjoint cycles with the same vertex set
by: Chakraborti, Debsoumya, et al.
Published: (2024)

Vertex-disjoint cycles of different lengths in tournaments
by: Bai, Yandong, et al.
Published: (2024)

Packing edge disjoint cliques in graphs
by: Balogh, József, et al.
Published: (2025)

Edge-disjoint linkage in infinite graphs
by: Assem, Amena, et al.
Published: (2025)

Extremal graphs for disjoint union of vertex-critical graphs
by: Zhang, Wenqian
Published: (2025)

Characterization of cycle obstruction sets for improper coloring planar graphs
by: Choi, Ilkyoo, et al.
Published: (2018)

The maximum number of cliques in disjoint copies of graphs
by: Gao, Zhipeng, et al.
Published: (2025)

Note on disjoint faces in simple topological graphs
by: Zeng, Ji
Published: (2023)

Curves on the torus with few intersections
by: Balla, Igor, et al.
Published: (2024)

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

Minimum degree edge-disjoint Hamilton cycles in random directed graphs
by: Ferber, Asaf, et al.
Published: (2025)

Bounds on treewidth via excluding disjoint unions of cycles
by: Hatzel, Meike, et al.
Published: (2025)

Spectral radius and edge-disjoint connected factors of graphs
by: Tang, Xinying, et al.
Published: (2026)

Generalized Turán results for disjoint copies of degenerate graphs
by: Yang, Caihong, et al.
Published: (2025)

Two-disjoint-cycle-cover vertex pancyclicity of split-star networks
by: Liu, Chang, et al.
Published: (2026)

Edge disjoint Hamilton cycles in random digraphs of constant minimum degree
by: Cooper, Colin, et al.
Published: (2026)

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

Variable degeneracy of planar graphs without chorded 6-cycles
by: Fang, Huihui, et al.
Published: (2025)

Eigenvalues, edge-disjoint perfect matchings and toughness of regular graphs
by: Zhang, Wenqian
Published: (2024)

Note on vertex disjoint rainbow triangles in edge-colored graphs
by: Kritschgau, Jürgen, et al.
Published: (2024)

Mutual-visibility of the disjointness graph of segments in ${\mathbb R}^2$
by: Leaños, J., et al.
Published: (2025)

Edge-connectivity and pairwise disjoint perfect matchings in regular graphs
by: Ma, Yulai, et al.
Published: (2022)

Density conditions for $k$ vertex-disjoint triangles in tripartite graphs
by: Guo, Mingyang, et al.
Published: (2025)

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

Constructing disjoint Steiner trees in Sierpiński graphs
by: Yang, Chenxu, et al.
Published: (2023)

On R-disjoint graphs: a generalization of almost bipartite non-König-Egerváry graphs
by: Pereyra, Kevin
Published: (2026)

Counting cycles in planar triangulations
by: Lo, On-Hei Solomon, et al.
Published: (2022)

The maximum number of triangles in graphs without vertex disjoint friendship graphs
by: Chen, Wanfang, et al.
Published: (2026)

Excluding disjoint Kuratowski graphs
by: Robertson, Neil, et al.
Published: (2024)

Long cycles and spectral radii in planar graphs
by: Xu, Ping, et al.
Published: (2024)

Signless Laplacian characterization of cones over disjoint unions of cycles, edges and isolated vertices
by: Ye, Jiachang, et al.
Published: (2025)

The independence ratio of 4-cycle-free planar graphs
by: Kelly, Tom, et al.
Published: (2023)

Small planar hypohamiltonian graphs
by: Tsai, Cheng-Chen
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)

Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles
by: Fang, Shu, et al.
Published: (2026)

Ramsey numbers of sparse graphs versus disjoint books
by: Huang, Ting, et al.
Published: (2025)