4.7 Article

On the P-3-Coloring of Bipartite Graphs

Related references

Note: Only part of the references are listed.
Article Multidisciplinary Sciences

On the P3 Coloring of Graphs

Hong Yang et al.

Summary: This article introduces a novel graph coloring called P-3 coloring, where the vertices of every P-3 path are assigned distinct colors. The aim of this article is to prove basic results and compute the P-3 chromatic number for different groups of graphs.

SYMMETRY-BASEL (2023)

Article Mathematics, Applied

Acyclic and star colorings of cographs

Andrew Lyons

DISCRETE APPLIED MATHEMATICS (2011)

Article Mathematics

A FAST ALGORITHM FOR EQUITABLE COLORING

Henry A. Kierstead et al.

COMBINATORICA (2010)

Article Computer Science, Information Systems

Acyclic colorings of subcubic graphs

S Skulrattanakulchai

INFORMATION PROCESSING LETTERS (2004)

Article Mathematics

Star coloring of graphs

G Fertin et al.

JOURNAL OF GRAPH THEORY (2004)

Article Computer Science, Software Engineering

Algorithmic aspects of acyclic edge colorings

N Alon et al.

ALGORITHMICA (2002)

Article Mathematics

Acyclic edge colorings of graphs

N Alon et al.

JOURNAL OF GRAPH THEORY (2001)

Article Computer Science, Theory & Methods

The complexity of path coloring and call scheduling

T Erlebach et al.

THEORETICAL COMPUTER SCIENCE (2001)

Article Mathematics

25 pretty graph colouring problems

TR Jensen et al.

DISCRETE MATHEMATICS (2001)

Article Mathematics

Circular chromatic number: a survey

XD Zhu

DISCRETE MATHEMATICS (2001)