:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Brucker, Francois, Préa, Pascal, Caro, Christopher Thraves
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics Combinatorics
Online Access:	https://arxiv.org/abs/2412.04118
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs
by: Bok, Jan, et al.
Published: (2020)

Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles
by: Burke, Kyle, et al.
Published: (2024)

Bounds on Functionality and Symmetric Difference -- Two Intriguing Graph Parameters
by: Dvořák, Pavel, et al.
Published: (2023)

4-tangrams are 4-avoidable
by: Ochem, Pascal, et al.
Published: (2025)

Space Efficient Algorithms for Parameterised Problems
by: Akhtar, Sheikh Shakil, et al.
Published: (2025)

Contact graphs of boxes with unidirectional contacts
by: Gonçalves, Daniel, et al.
Published: (2023)

On graphs with a simple structure of maximal cliques
by: Gollin, J. Pascal, et al.
Published: (2025)

Critical exponent of binary words with few distinct palindromes
by: Dvořáková, L'ubomíra, et al.
Published: (2023)

HBS Tilings Extended: State of the Art and Novel Observations
by: Porrier, Carole
Published: (2023)

Optimizing alphabet reduction pairs of arrays
by: Culus, Jean-François, et al.
Published: (2024)

Acyclic colourings of graphs with obstructions
by: Chuet, Quentin, et al.
Published: (2022)

A Necessary Condition for Connectedness of Solutions to Integer Linear Systems
by: Shigenobu, Takasugu, et al.
Published: (2025)

A Uniformly Random Solution to Algorithmic Redistricting
by: Cai, Jin-Yi, et al.
Published: (2024)

Algorithms and hardness for Metric Dimension on digraphs
by: Dailly, Antoine, et al.
Published: (2023)

On the Architectural Complexity of Neural Networks
by: Cooper, Nicholas J., et al.
Published: (2026)

A Note on the Complexity of Graph Recoloring
by: Bousquet, Nicolas
Published: (2024)

Line Graphs of Non-Word-Representable Graphs are Not Always Non-Word-Representable
by: Mozhui, Khyodeno, et al.
Published: (2025)

An Efficient Genus Algorithm Based on Graph Rotations
by: Metzger, Alexander, et al.
Published: (2024)

Hypergraphs with Polynomial Representation: Introducing $r$-splits
by: Pitois, François, et al.
Published: (2022)

New bounds for proper $h$-conflict-free colourings
by: Chuet, Quentin, et al.
Published: (2025)

Fractional domatic number and minimum degree
by: Chuet, Quentin, et al.
Published: (2025)

On the Identity and Group Problems for Complex Heisenberg Matrices
by: Bell, Paul C., et al.
Published: (2023)

The Non-Cancelling Intersections Conjecture
by: Amarilli, Antoine, et al.
Published: (2024)

Non-dissective coverings by planks
by: Kupavskii, Andrey, et al.
Published: (2025)

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

Algorithmic methods of finite discrete structures. Isomorphism of Nonseparable Graphs
by: Kurapov, Sergey, et al.
Published: (2024)

Recognition Complexity of Subgraphs of k-Connected Planar Cubic Graphs
by: Goetze, Miriam, 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 Complexity of Hop Domination and 2-Step Domination in Graph Classes
by: Das, Sandip, et al.
Published: (2026)

Complexity of the Feedback Vertex Set Problem in Tournaments with Forbidden Subtournaments
by: Spirkl, Sophie, et al.
Published: (2026)

$χ$-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs
by: Bonamy, Marthe, et al.
Published: (2025)

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality
by: Laddha, Aditi, et al.
Published: (2025)

Non-Promise Version of Unique Sink Orientations
by: Marques, Tiago Oliveira
Published: (2024)

Chromatic discrepancy of locally $s$-colourable graphs
by: Corsini, Timothée, et al.
Published: (2025)

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
by: Lozin, Vadim, et al.
Published: (2022)

Computational Complexity of Covering Colored Mixed Multigraphs with Simple Degree Partitions
by: Bok, Jan, et al.
Published: (2025)

Max-Min and 1-Bounded Space Algorithms for the Bin Packing Problem
by: Fujiwara, Hiroshi, et al.
Published: (2025)

Algorithmic methods of finite discrete structures. Topological graph drawing (part I)
by: Kurapov, Sergey, et al.
Published: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part II)
by: Kurapov, Sergey, et al.
Published: (2024)