Saved in:
| Main Authors: | Kalyanasundaram, Subrahmanyam, Kumar, Subodh |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2605.12068 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
by: Bhyravarapu, Sriram, et al.
Published: (2021)
by: Bhyravarapu, Sriram, et al.
Published: (2021)
Extremal Results on Conflict-free Coloring
by: Bhyravarapu, Sriram, et al.
Published: (2023)
by: Bhyravarapu, Sriram, et al.
Published: (2023)
Extremal Results on Conflict‐Free Coloring
by: Sriram Bhyravarapu, et al.
Published: (2025)
by: Sriram Bhyravarapu, et al.
Published: (2025)
A bound for the cops and robber problem in terms of 2-component order connectivity
by: Jain, Suryaansh, et al.
Published: (2024)
by: Jain, Suryaansh, et al.
Published: (2024)
Degenerate Vertex Cuts in Sparse Graphs
by: Hartel, Thilo, et al.
Published: (2025)
by: Hartel, Thilo, et al.
Published: (2025)
Asymptotically Optimal Proper Conflict-Free Colouring
by: Liu, Chun-Hung, et al.
Published: (2024)
by: Liu, Chun-Hung, et al.
Published: (2024)
Asymptotically Tight Bound for the Conflict-Free Chromatic Index
by: Kamyczura, Mateusz, et al.
Published: (2026)
by: Kamyczura, Mateusz, et al.
Published: (2026)
On the Regularity, Planarity and Edge Bounds of Link-irregular Graphs
by: Bastien, Alexander, et al.
Published: (2025)
by: Bastien, Alexander, et al.
Published: (2025)
Proper Conflict-free Coloring of Graphs with Large Maximum Degree
by: Cranston, Daniel W., et al.
Published: (2022)
by: Cranston, Daniel W., et al.
Published: (2022)
Shellability of $3$-Cut Complexes of Squared Cycle Graphs
by: Chauhan, Pratiksha, et al.
Published: (2024)
by: Chauhan, Pratiksha, et al.
Published: (2024)
A Formal Analogue of Euler's Formula for Infinite Planar Regular Graphs
by: Jędrzejewicz, Piotr, et al.
Published: (2025)
by: Jędrzejewicz, Piotr, et al.
Published: (2025)
Conflict-free Hypergraph Matchings and Coverings
by: Joos, Felix, et al.
Published: (2024)
by: Joos, Felix, et al.
Published: (2024)
Conflict-Free Colouring of Subsets
by: Jartoux, Bruno, et al.
Published: (2022)
by: Jartoux, Bruno, et al.
Published: (2022)
Conflict-free chromatic index of bipartite graphs
by: Jin, Yuxin, et al.
Published: (2026)
by: Jin, Yuxin, et al.
Published: (2026)
Conflict-free chromatic index of trees
by: Guo, Shanshan, et al.
Published: (2024)
by: Guo, Shanshan, et al.
Published: (2024)
The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability
by: Feghali, Carl, et al.
Published: (2025)
by: Feghali, Carl, et al.
Published: (2025)
Free Sets in Planar Graphs: History and Applications
by: Dujmović, Vida, et al.
Published: (2024)
by: Dujmović, Vida, et al.
Published: (2024)
3-Colouring Planar Graphs
by: Dujmović, Vida, et al.
Published: (2025)
by: Dujmović, Vida, et al.
Published: (2025)
Computational and Combinatorial Results on Conflict-free Choosability
by: Gupta, Shiwali, et al.
Published: (2026)
by: Gupta, Shiwali, et al.
Published: (2026)
On Solving the Set Covering Problem with Conflicts on Sets
by: Montemanni, Roberto, et al.
Published: (2025)
by: Montemanni, Roberto, et al.
Published: (2025)
Competitively Constructed Planar Graphs
by: Pegden, Wesley, et al.
Published: (2025)
by: Pegden, Wesley, et al.
Published: (2025)
Weak Degeneracy of Planar Graphs
by: Bernshteyn, Anton, et al.
Published: (2024)
by: Bernshteyn, Anton, et al.
Published: (2024)
Local Limit of Random Regular Bipartite Planar Maps
by: Tokka, Nicolas
Published: (2026)
by: Tokka, Nicolas
Published: (2026)
A Note on Odd Colorings of 1-Planar Graphs
by: Cranston, Daniel W., et al.
Published: (2022)
by: Cranston, Daniel W., et al.
Published: (2022)
Vertex Ranking of Degenerate Graphs
by: Iacono, John, et al.
Published: (2024)
by: Iacono, John, et al.
Published: (2024)
Conflict-Aware Seat Assignment in Classroom Environments
by: Charytitsch, Bruna Cristina Braga, et al.
Published: (2026)
by: Charytitsch, Bruna Cristina Braga, et al.
Published: (2026)
Forest Cuts in Sparse Graphs
by: Chernyshev, Vsevolod, et al.
Published: (2024)
by: Chernyshev, Vsevolod, et al.
Published: (2024)
Equitable Coloring in 1-Planar Graphs
by: Cranston, Daniel, et al.
Published: (2023)
by: Cranston, Daniel, et al.
Published: (2023)
Local Weak Degeneracy of Planar Graphs
by: Davies, Ewan, et al.
Published: (2025)
by: Davies, Ewan, et al.
Published: (2025)
Saturated Partial Embeddings of Planar Graphs
by: Clifton, Alexander, et al.
Published: (2024)
by: Clifton, Alexander, et al.
Published: (2024)
10-list Recoloring of Planar Graphs
by: Cranston, Daniel W.
Published: (2024)
by: Cranston, Daniel W.
Published: (2024)
On 1-Planar Graphs with Bounded Cop-Number
by: Bose, Prosenjit, et al.
Published: (2024)
by: Bose, Prosenjit, et al.
Published: (2024)
Series-Parallel and Planar Graphs for Efficient Broadcasting
by: Evangelista, David, et al.
Published: (2026)
by: Evangelista, David, et al.
Published: (2026)
Acyclic List Colouring Locally Planar Graphs
by: Postle, Luke, et al.
Published: (2024)
by: Postle, Luke, et al.
Published: (2024)
Finding $d$-Cuts in Probe $H$-Free Graphs
by: Dabrowski, Konrad K., et al.
Published: (2025)
by: Dabrowski, Konrad K., et al.
Published: (2025)
Treewidth of Outer $k$-Planar Graphs
by: Pyzik, Rafał
Published: (2025)
by: Pyzik, Rafał
Published: (2025)
Optimal Constant-Weight and Mixed-Weight Conflict-Avoiding Codes
by: Lo, Yuan-Hsun, et al.
Published: (2024)
by: Lo, Yuan-Hsun, et al.
Published: (2024)
On Clique Graphs and Clique Regular Graphs
by: Petro, Robert R., et al.
Published: (2025)
by: Petro, Robert R., et al.
Published: (2025)
On 3-Connected Planar Graphs with Unique Orientable Circuit Double Covers
by: Weiß, Meike, et al.
Published: (2026)
by: Weiß, Meike, et al.
Published: (2026)
On 3-Connected Cubic Planar Graphs and their Strong Embeddings on Orientable Surfaces
by: Weiß, Meike, et al.
Published: (2025)
by: Weiß, Meike, et al.
Published: (2025)
Similar Items
-
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
by: Bhyravarapu, Sriram, et al.
Published: (2021) -
Extremal Results on Conflict-free Coloring
by: Bhyravarapu, Sriram, et al.
Published: (2023) -
Extremal Results on Conflict‐Free Coloring
by: Sriram Bhyravarapu, et al.
Published: (2025) -
A bound for the cops and robber problem in terms of 2-component order connectivity
by: Jain, Suryaansh, et al.
Published: (2024) -
Degenerate Vertex Cuts in Sparse Graphs
by: Hartel, Thilo, et al.
Published: (2025)