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

In this chapter, the phasing of traffic lights in urban intersections is introduced and discussed applying the graph theory…

2012

The purpose of this study is to find the acyclic chromatic number for central graph, middle graph, total graph and line graph of…

2008

The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices…

2006

The concept of half-star chromatic number is given by studying a singal assignment problem with constraint conditions,and the…

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

Having generalized the construction of Moser, we provide a systematic method of constructing planar graphs with a rational number…

1993

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