Star coloring

In graph-theoretic mathematics, a star coloring of a graph G is a (proper) vertex coloring in which every path on four vertices uses at least three…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

In a graph whose vertices are assigned integer ranks, a path is well-ranked if the endpoints have distinct ranks or some interior…

2014

The detour order of a graph $G$, denoted $\tau(G)$, is the order of a longest path in $G$. A partition $(A, B)$ of $V(G)$ such…

2013

Abstract A star coloring of an undirected graph G is a coloring of the vertices of G such that (i) no two adjacent vertices…

2004

Summary form only given. We study conflict-free data distribution schemes in parallel memories in multiprocessor system…

2001

In this paper, we deal with the notion of star coloring of graphs. A star coloring of an undirected graph G is a proper vertex…

2001

Let G be a simple graph, LG denote the line graph of G .This paper discussed the star chromatic number of line graph,and got two…

2001

We construct sonic infinite family of planar graphs with star chromatic number, where, partially answering a question of Vince，

2000

A sufficient condition for the special circulation graphs whose starchromatic number is equal to it's fractional chromatic is…

1995

1993

We study a generalization of the notion of the chromatic number of a graph in which the colors assigned to adjacent vertices are…