Cover Image

Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bhyravarapu, Sriram, Hartmann, Tim A., Hoang, Hung P., Kalyanasundaram, Subrahmanyam, Reddy, I. Vinod
Format:	Preprint
Published:	2021
Subjects:	Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Extremal Results on Conflict-free Coloring
by: Bhyravarapu, Sriram, et al.
Published: (2023)

A bound for the cops and robber problem in terms of 2-component order connectivity
by: Jain, Suryaansh, et al.
Published: (2024)

On Realizing Reconfiguration Graphs of Cliques
by: Hoang, Duc A.
Published: (2026)

Maximal Cliques in Scale-Free Random Graphs
by: Bläsius, Thomas, et al.
Published: (2023)

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

Comparing Width Parameters on Graph Classes
by: Brettell, Nick, et al.
Published: (2023)

Flips and Merge-Width in Sparse Graphs
by: Drabik, Karolina, et al.
Published: (2026)

Bounding Width on Graph Classes of Constant Diameter
by: Dabrowski, Konrad K., et al.
Published: (2025)

Induced Minors and Region Intersection Graphs
by: Bonnet, Édouard, et al.
Published: (2025)

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

Cube Height, Cube Width and Related Extremal Problems for Posets
by: Bastide, Paul, et al.
Published: (2025)

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

Graph Reconstruction with Connectivity Queries
by: Kluk, Kacper, et al.
Published: (2024)

Lower Bounds for Induced-Universal Graphs
by: Gavoille, Cyril, et al.
Published: (2025)

Bounds on the Complete Forcing Number of Graphs
by: Ebrahimi, Javad B., et al.
Published: (2024)

Supports for Outerplanar and Bounded Treewidth Graphs
by: Raman, Rajiv, et al.
Published: (2025)

Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees
by: Gerke, Stefanie, et al.
Published: (2024)

Counting Colored Tilings on Grids and Graphs
by: Ramírez, José L., et al.
Published: (2024)

Clique-Width: Harnessing the Power of Atoms
by: Dabrowski, Konrad K., et al.
Published: (2020)

On 1-Planar Graphs with Bounded Cop-Number
by: Bose, Prosenjit, et al.
Published: (2024)

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

Upper Bounds on the Acyclic Chromatic Index of Degenerate Graphs
by: Anto, Nevil, et al.
Published: (2023)

Intersection Graphs with and without Product Structure
by: Merker, Laura, et al.
Published: (2024)

Further Results and Questions on $S$-Packing Coloring of Subcubic Graphs
by: Mortada, Maidoun, et al.
Published: (2024)

The Graph Coloring Game on $4\times n$-Grids
by: Brosse, Caroline, et al.
Published: (2024)

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

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

Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs
by: D'Elia, Marco, et al.
Published: (2024)

Clique-width and induced topological minors
by: Bieliński, Paweł Rafał, et al.
Published: (2026)

Characterizing Large Clique Number in Tournaments
by: Crew, Logan, et al.
Published: (2026)

Weighted Clique and Independent Set in Edge-Distant Hereditary Graphs
by: Srinivasan, Eshwar, et al.
Published: (2026)

The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability
by: Feghali, Carl, et al.
Published: (2025)

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

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

First-Order Logic and Twin-Width for Some Geometric Graphs
by: Geniet, Colin, et al.
Published: (2025)

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

Coarse Balanced Separators in Fat-Minor-Free Graphs
by: Bonnet, Édouard, et al.
Published: (2026)

Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs
by: Lucke, Felicia, et al.
Published: (2024)

Conflict-Free Cuts in Planar and 3-Degenerate Graphs with 1-Regular Conflicts
by: Kalyanasundaram, Subrahmanyam, et al.
Published: (2026)

Bounds on treewidth via excluding disjoint unions of cycles
by: Hatzel, Meike, et al.
Published: (2025)