:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Potapov, Igor, Prokopenko, Tymofii, Sylvester, John
Format:	Preprint
Publié:	2025
Sujets:	Discrete Mathematics Data Structures and Algorithms Combinatorics
Accès en ligne:	https://arxiv.org/abs/2509.05024
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Cops and Robbers on Multi-Layer Graphs
par: Enright, Jessica, et autres
Publié: (2023)

Coarse Balanced Separators in Fat-Minor-Free Graphs
par: Bonnet, Édouard, et autres
Publié: (2026)

Separating Feasibility and Movement in Solution Discovery: The Case of Path Discovery
par: von Bergen, Hanno, et autres
Publié: (2026)

Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
par: Adamson, Duncan, et autres
Publié: (2023)

Separable convex optimization over indegree polytopes
par: Borsik, Nóra A., et autres
Publié: (2025)

The Strong Birthday Problem Revisited
par: Tripathy, Chijul B.
Publié: (2025)

Reconfiguration of List Colourings
par: Cambie, Stijn, et autres
Publié: (2025)

Parameterized complexity of isometric path partition: treewidth and diameter
par: Chakraborty, Dibyayan, et autres
Publié: (2025)

On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
par: Ghanbari, Babak, et autres
Publié: (2025)

On the Enumeration of all Unique Paths of Recombining Trinomial Trees
par: Torres, Ethan, et autres
Publié: (2025)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
par: An, Shinwoo, et autres
Publié: (2025)

Optimal and Efficient Partite Decompositions of Hypergraphs
par: Krapivin, Andrew, et autres
Publié: (2025)

Matrix Scaling: a New Heuristic for the Feedback Vertex Set Problem
par: Shook, James M., et autres
Publié: (2025)

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
par: Deligkas, Argyrios, et autres
Publié: (2025)

Parameterised algorithms for temporally satisfying reconfiguration problems
par: Davot, Tom, et autres
Publié: (2025)

Computing Treedepth Obstructions
par: Kühn, Kolja
Publié: (2025)

Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
par: Bencs, Ferenc, et autres
Publié: (2025)

Interval H-graphs : Recognition and forbidden obstructions
par: Müller, Haiko, et autres
Publié: (2025)

Dvorak-Dell-Grohe-Rattan theorem via an asymptotic argument
par: Kozachinskiy, Alexander
Publié: (2025)

Constructive Characterization and Recognition Algorithm for Grafts with a Connected Minimum Join
par: Kita, Nanano
Publié: (2025)

Twin-width one
par: Ahn, Jungho, et autres
Publié: (2025)

Towards Transitive-free Digraphs
par: Abhinav, Ankit, et autres
Publié: (2025)

Light Edge Fault Tolerant Graph Spanners
par: Bodwin, Greg, et autres
Publié: (2025)

Enumerating minimal dominating sets and variants in chordal bipartite graphs
par: Castelo, Emanuel, et autres
Publié: (2025)

An Improved Bound for the Beck-Fiala Conjecture
par: Bansal, Nikhil, et autres
Publié: (2025)

Bounding Width on Graph Classes of Constant Diameter
par: Dabrowski, Konrad K., et autres
Publié: (2025)

Circulant TSP: Vertices of the Edge-Length Polytope and Superpolynomial Lower Bounds
par: Gutekunst, Samuel C.
Publié: (2025)

Colouring Probe $H$-Free Graphs
par: Paulusma, Daniël, et autres
Publié: (2025)

Sandwich Monotonicity and the Recognition of Weighted Graph Classes
par: Beisegel, Jesse, et autres
Publié: (2025)

Translating between the representations of an acyclic convex geometry of bounded degree
par: Defrain, Oscar, et autres
Publié: (2025)

Computational Verification of the Buratti--Horak--Rosa Conjecture for Small Integers and Inductive Approaches
par: Naik, Ranjan N
Publié: (2025)

A Polynomial-Time Approximation Algorithm for Complete Interval Minors
par: Bourneuf, Romain, et autres
Publié: (2025)

Graph parameters that are coarsely equivalent to path-length
par: Dragan, Feodor F., et autres
Publié: (2025)

Efficient space reduction techniques by optimized majority rules for the Kemeny aggregation problem and beyond
par: Phung, Xuan Kien, et autres
Publié: (2025)

A Fast Algorithm for Finding Minimum Weight Cycles in Mining Cyclic Graph Topologies
par: Shakeri, Heman, et autres
Publié: (2025)

A Structural Linear-Time Algorithm for Computing the Tutte Decomposition
par: Bourneuf, Romain, et autres
Publié: (2025)

Tight Bounds for Sparsifying Random CSPs
par: Brakensiek, Joshua, et autres
Publié: (2025)

Extending Ghouila-Houri's Characterization of Comparability Graphs to Temporal Graphs
par: Charbit, Pierre, et autres
Publié: (2025)

Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
par: Galby, Esther, et autres
Publié: (2025)

Thin Trees via $k$-Respecting Cut Identities
par: Daga, Mohit
Publié: (2025)