Cover Image

Path degeneracy and applications

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lin, Y., de Mendez, P. Ossona
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Redicolouring digraphs: directed treewidth and cycle-degeneracy
by: Nisse, Nicolas, et al.
Published: (2023)

Characterizations of monadically dependent tree-ordered weakly sparse structures
by: Buffière, Hector, et al.
Published: (2026)

Twin-width and permutations
by: Bonnet, Édouard, et al.
Published: (2021)

Decomposition horizons and a characterization of stable hereditary classes of graphs
by: Braunfeld, Samuel, et al.
Published: (2022)

On first-order transductions of classes of graphs
by: Braunfeld, Samuel, et al.
Published: (2022)

Path eccentricity of $k$-AT-free graphs and application on graphs with the consecutive ones property
by: Bastide, Paul, et al.
Published: (2024)

Bounds on Path Energy of Graphs
by: Narke, Amol P., et al.
Published: (2022)

Backward Arcs in Hamilton Oriented Cycles and Paths in Directed Graphs with Independence Number Two
by: Gerke, S., et al.
Published: (2026)

Variable degeneracy on toroidal graphs
by: Li, Rui, et al.
Published: (2019)

Progressive and Rushed Dyck Paths
by: Bacher, Axel
Published: (2024)

Sublinear Longest Path Transversals
by: Long Jr., James A., et al.
Published: (2020)

Coloring Grids Avoiding Bicolored Paths
by: Keskinkilic, Derman, et al.
Published: (2023)

On Separating Path and Tree Systems in Graphs
by: Biniaz, Ahmad, et al.
Published: (2023)

Menger's Theorem for Temporal Paths (Not Walks)
by: Ibiapina, Allen, et al.
Published: (2022)

Covering Complete Geometric Graphs by Monotone Paths
by: Dumitrescu, Adrian, et al.
Published: (2025)

The Complexity of Color-constrained Paths in Semicomplete Multipartite Digraphs
by: Brinkmann, Julian
Published: (2025)

Vertex-Based Localization of Erdős-Gallai Theorems for Paths and Cycles
by: Adak, Rajat, et al.
Published: (2025)

On Euler Paths and the Maximum Degree Growth of Iterated Higher Order Line Graphs
by: Sanghi, Aryan, et al.
Published: (2026)

Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension
by: Bartier, Valentin, et al.
Published: (2023)

Restricted subgraphs of edge-colored graphs and applications
by: Sudakov, Benny
Published: (2024)

On merge-models
by: Buffière, Hector, et al.
Published: (2026)

Tree decompositions whose trees are subgraphs: An application of Simon's factorization
by: Bourneuf, Romain, et al.
Published: (2026)

Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
by: Kelly, Tom, et al.
Published: (2018)

Conflict-free chromatic index of trees
by: Guo, Shanshan, et al.
Published: (2024)

Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs
by: Botler, F., et al.
Published: (2024)

Planar cycle-extendable graphs
by: Dalwadi, Aditya Y, et al.
Published: (2024)

Binary Weight Allocation for Multi-Objective Path Optimization: Efficient Earliest and Latest Path Discovery in Network Systems
by: Yeh, Wei-Chang
Published: (2025)

Spread blow-up lemma with an application to perturbed random graphs
by: Nenadov, Rajko, et al.
Published: (2024)

Making Walks Count: From Silent Circles to Hamiltonian Cycles
by: Alekseyev, Max A., et al.
Published: (2016)

On approximating the rank of graph divisors
by: Bérczi, Kristóf, et al.
Published: (2022)

A sharp version of Talagrand's selector process conjecture and an application to rounding fractional covers
by: Pham, Huy Tuan
Published: (2024)

Complexity Issues Concerning the Quadruple Roman Domination Problem in Graphs
by: Palagiri, V. S. R., et al.
Published: (2024)

Automorphism groups of Cayley graphs generated by general transposition sets
by: Gijswijt, Dion, et al.
Published: (2024)

Counting the minimum number of arcs in an oriented graph having weak diameter 2
by: Das, Sandip, et al.
Published: (2023)

Face-hitting Dominating Sets in Planar Graphs
by: Francis, P., et al.
Published: (2024)

Maximal Independent Sets in Planar Triangulations
by: Francis, P., et al.
Published: (2024)

The only Class 0 Flower snark is the smallest
by: Bridi, Guilherme Adamatti, et al.
Published: (2025)

Hitting all longest paths in $H$-free graphs and $H$-graphs
by: de Lima, Paloma T., et al.
Published: (2025)

Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
by: Bhyravarapu, Sriram, et al.
Published: (2021)

Ramsey Goodness of paths and unbalanced graphs
by: Botler, Fábio, et al.
Published: (2024)