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

Sriram Bhyravarapu; Subrahmanyam Kalyanasundaram; Rogers Mathew

doi:10.1016/j.tcs.2025.115080

ScienceGate Book Chapters

JOURNAL ARTICLE

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

Sriram Bhyravarapu Subrahmanyam Kalyanasundaram Rogers Mathew

Year: 2025 Journal: Theoretical Computer Science Vol: 1031 Pages: 115080-115080 Publisher: Elsevier BV

DOI: 10.1016/j.tcs.2025.115080

Get Full-Text PDF Get Analytical Report

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

Cited By

0.00

FWCI (Field Weighted Citation Impact)

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

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

Metrics

Topics

Related Documents

Injective coloring of some subclasses of bipartite graphs and chordal graphs

Coloring Bull-Free Perfect Graphs

On rank-perfect subclasses of near-bipartite graphs

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

Conflict-Free Coloring of Graphs