:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Auger, David, Coucheney, Pierre, Etse, Kossi Roland
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics Combinatorics
Online Access:	https://arxiv.org/abs/2411.18364
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Reachability in temporal graphs under perturbation
by: Enright, Jessica, et al.
Published: (2024)

Sparse String Graphs and Region Intersection Graphs over Minor-Closed Classes have Linear Expansion
by: Karol, Nikolai, et al.
Published: (2026)

Temporal Reachability Dominating Sets: contagion in temporal graphs
by: Kutner, David C., et al.
Published: (2023)

Contractions in perfect graph
by: Dupont-Bouillard, Alexandre, et al.
Published: (2024)

Localization: A Framework to Generalize Extremal Graph Problems
by: Adak, Rajat, et al.
Published: (2025)

Directed Acyclic Outerplanar Graphs Have Constant Stack Number
by: Jungeblut, Paul, et al.
Published: (2022)

Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs
by: Paul, Kaustav, et al.
Published: (2024)

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

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

On the Extension Theorem for Packing Steiner Forests
by: Zeng, Jinghan A
Published: (2026)

Size-4 Counterexamples to the Sidon-Extension Conjecture
by: Niu, Tong
Published: (2026)

Extension of the Gyárfás-Sumner conjecture to signed graphs
by: Aubian, Guillaume, et al.
Published: (2025)

Maximum Eccentric Connectivity Index for Graphs with Given Diameter
by: Hauweele, Pierre, et al.
Published: (2018)

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

Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices
by: Devillez, Gauvain, et al.
Published: (2018)

Enumerating Two-Orbit Graphs
by: Seka, David, et al.
Published: (2026)

String Graph Obstacles of High Girth and of Bounded Degree
by: Chudnovsky, Maria, et al.
Published: (2025)

Octal Games on Graphs: The game 0.33 on subdivided stars and bistars
by: Beaudou, Laurent, et al.
Published: (2016)

Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity
by: Dong, Sally, et al.
Published: (2023)

3-Colouring Planar Graphs
by: Dujmović, Vida, et al.
Published: (2025)

Linear colorings of graphs
by: Hilaire, Claire, et al.
Published: (2025)

The Zarankiewicz Problem for Polygon Visibility Graphs
by: Ackerman, Eyal, et al.
Published: (2025)

Extremal Chemical Graphs for the Arithmetic-Geometric Index
by: Hertz, Alain, et al.
Published: (2024)

Fortuitous sequences of flips of the top of a stack of n burnt pancakes for all n>24
by: Pierre, Laurent
Published: (2016)

The Bottleneck Birthday Problem
by: Tripathy, Chijul B.
Published: (2025)

A Proof of the 2004 Albert-Grossman-Nowakowski-Wolfe Conjecture on Alternating Linear Clobber
by: Chen, Xinyue, et al.
Published: (2025)

Treewidth 2 in the Planar Graph Product Structure Theorem
by: Distel, Marc, et al.
Published: (2024)

Forbidden Patterns in Mixed Linear Layouts
by: Haun, Deborah, et al.
Published: (2024)

Bounds on Linear Turán Number for Trees
by: Adak, Rajat, et al.
Published: (2026)

Linear versus centred chromatic numbers
by: Bose, Prosenjit, et al.
Published: (2022)

On The Maximum Linear Arrangement Problem for Trees
by: Alemany-Puig, Lluís, et al.
Published: (2023)

On a Problem of Ramsey Theory
by: Frasser, Carlos E.
Published: (2024)

The Rainbow Arborescence Problem on Cycles
by: Bérczi, Kristóf, et al.
Published: (2025)

Characterization of Circular-arc Graphs: III. Chordal Graphs
by: Cao, Yixin, et al.
Published: (2024)

Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing
by: Chakrabarty, Deeparnab, et al.
Published: (2024)

An Upper Bound on the Linear Turán Number of $k$-Crowns
by: Adak, Rajat
Published: (2026)

On arborescence packing augmentation in hypergraphs
by: Hoppenot, Pierre, et al.
Published: (2024)

Augmenting a hypergraph to have a matroid-based $(f,g)$-bounded $(α,β)$-limited packing of rooted hypertrees
by: Hoppenot, Pierre, et al.
Published: (2024)

Graph Theory
by: Gilbert, Jesse D.
Published: (2011)

Characterization of Chordal Circular-arc Graphs: I. Split Graphs
by: Cao, Yixin, et al.
Published: (2024)