:: Library Catalog

Saved in:

Bibliographic Details
Main Authors:	Wang, Yichen, Lu, Mei
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2402.04526
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Algorithm for finding vertex-edge domination number on graphs with bounded treewidth and related problems on planar graphs
by: Wang, Yichen, et al.
Published: (2026)

Linear recoloring diameter of degenerate chordal graphs and bounded treewidth graphs
by: Wang, Yichen, et al.
Published: (2025)

Inversion diameter and treewidth
by: Wang, Yichen, et al.
Published: (2024)

On the zero-free region for the chromatic polynomial of graphs with maximum degree $Δ$ and girth $g$
by: Fialho, Paula M. S., et al.
Published: (2024)

On graphs with chromatic number and maximum degree both equal to nine
by: Galindo, Rachel, et al.
Published: (2024)

Nonregular graphs with a given maximum degree attaining maximum spectral radius
by: Huang, Zejun, et al.
Published: (2024)

The oriented chromatic number of random graphs of bounded degree
by: Gunderson, Karen, et al.
Published: (2022)

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

Graphs that are quasi-isometric to graphs with bounded treewidth
by: Hickingbotham, Robert
Published: (2025)

The maximum number of cliques in graphs with given fractional matching number and minimum degree
by: Li, Chengli, et al.
Published: (2024)

The maximum size of a nonhamiltonian-connected graph with given order and minimum degree
by: Zhang, Leilei
Published: (2024)

On the maximum $σ$-irregularity of trees with given order and maximum degree
by: Bašić, Milan
Published: (2026)

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

An alternative characterisation of graphs quasi-isometric to graphs of bounded treewidth
by: Distel, Marc
Published: (2025)

An improved quasi-isometry between graphs of bounded cliquewidth and graphs of bounded treewidth
by: Distel, Marc
Published: (2025)

Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
by: Chakraborty, Dipayan, et al.
Published: (2024)

Induced Ramsey problems for trees and graphs with bounded treewidth
by: Hunter, Zach, et al.
Published: (2024)

The strong chromatic index of 1-planar graphs
by: Wang, Yiqiao, et al.
Published: (2022)

Identifying codes in graphs of given maximum degree: Characterizing trees
by: Chakraborty, Dipayan, et al.
Published: (2024)

Universal diameter bounds for random graphs with given degrees
by: Addario-Berry, Louigi, et al.
Published: (2025)

Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
by: Bencs, Ferenc, et al.
Published: (2025)

Chordal graphs, even-hole-free graphs and sparse obstructions to bounded treewidth
by: Hajebi, Sepehr
Published: (2024)

On the mod $k$ chromatic index of graphs
by: Nweit, Oothan, et al.
Published: (2024)

A generalization of Erdős-Hajnal problem on paths with equal-degree endpoints
by: Zhao, Xiamiao, et al.
Published: (2026)

Extremal regular graphs of given chromatic number
by: Rubio-Montiel, Christian
Published: (2019)

Counting induced subgraphs with given intersection sizes
by: Zhang, Haixiang, et al.
Published: (2025)

On minimizing the Wiener index of unicyclic graphs with fixed girth and given degree sequence
by: Burger, Alewyn P., et al.
Published: (2024)

An improvement on the bound for the acyclic chromatic index
by: Kirousis, Lefteris, et al.
Published: (2026)

On graphs with maximum difference between game chromatic number and chromatic number
by: Hollom, Lawrence
Published: (2023)

Cycle lengths in graphs of given minimum degree
by: Bai, Yandong, et al.
Published: (2025)

On the chromatic symmetric homology for star graphs
by: Pierson, Laura
Published: (2024)

Conflict-free chromatic index of bipartite graphs
by: Jin, Yuxin, et al.
Published: (2026)

Odd and even cycle lengths, minimum degree and chromatic number in graphs
by: Wang, Xiaolin
Published: (2025)

On asymptotically tight bound for the conflict-free chromatic index of nearly regular graphs
by: Kamyczura, Mateusz, et al.
Published: (2024)

Diameters and mixing times for giant components of random graphs with given degrees
by: Addario-Berry, Louigi, et al.
Published: (2026)

Clustered independence and bounded treewidth
by: Knauer, Kolja, et al.
Published: (2023)

Excluding a clique or a biclique in graphs of bounded induced matching treewidth
by: Abrishami, Tara, et al.
Published: (2024)

The edge chromatic transformation index of graphs
by: Asratian, Armen S., et al.
Published: (2025)

A strengthening on consecutive odd cycles in graphs of given minimum degree
by: Lin, Hao, et al.
Published: (2024)

Randomized algorithms to generate hypergraphs with given degree sequences
by: Ascolese, Michela, et al.
Published: (2024)