JOURNAL ARTICLE

Conflict-free coloring on subclasses of perfect graphs and bipartite graphs

Sriram BhyravarapuSubrahmanyam KalyanasundaramRogers Mathew

Year: 2025 Journal:   Theoretical Computer Science Vol: 1031 Pages: 115080-115080   Publisher: Elsevier BV
Keywords:
Strong perfect graph theorem Combinatorics Bipartite graph Mathematics Chordal graph Cograph Discrete mathematics Indifference graph Greedy coloring 1-planar graph Graph Line graph

Metrics

0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
28
Refs
0.02
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Graph Labeling and Dimension Problems
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Advanced Graph Theory Research
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
graph theory and CDMA systems
Physical Sciences →  Engineering →  Electrical and Electronic Engineering

Related Documents

JOURNAL ARTICLE

Injective coloring of some subclasses of bipartite graphs and chordal graphs

B. S. PandaPriyamvada

Journal:   Discrete Applied Mathematics Year: 2020 Vol: 291 Pages: 68-87
JOURNAL ARTICLE

Coloring Bull-Free Perfect Graphs

Irena Penev

Journal:   SIAM Journal on Discrete Mathematics Year: 2012 Vol: 26 (3)Pages: 1281-1309
JOURNAL ARTICLE

On rank-perfect subclasses of near-bipartite graphs

Annegret K. Wagler

Journal:   4OR Year: 2005 Vol: 3 (4)Pages: 329-336
BOOK-CHAPTER

Partial Grundy Coloring in Some Subclasses of Bipartite Graphs and Chordal Graphs

B. S. PandaShaily Verma

Lecture notes in computer science Year: 2017 Pages: 228-237
JOURNAL ARTICLE

Conflict-Free Coloring of Graphs

Zachary AbelVíctor ÁlvarezErik D. DemaineSándor P. FeketeAman GourAdam HesterbergPhillip KeldenichChristian Scheffer

Journal:   SIAM Journal on Discrete Mathematics Year: 2018 Vol: 32 (4)Pages: 2675-2702
© 2026 ScienceGate Book Chapters — All rights reserved.