Profiles
Research Units
Publications
Sign Up
Faculty Login
X
Articles
Oriented colouring of some graph products
N.R. Aravind
,
N. Narayanan
,
C.R. Subramanian
Published in University of Zielona Gora
2011
DOI:
10.7151/dmgt.1572
Volume: 31
Issue: 4
Pages: 675 - 686
Abstract
We obtain some improved upper and lower bounds on the oriented chromatic number for different classes of products of graphs.
Download
PDF
Publisher Copy
Cite
Publisher Copy Version
Content may be subject to copyright,
Check License
PDF
Figures & Tables (5)
Journal Details
Authors (1)
About the journal
Journal
Discussiones Mathematicae - Graph Theory
Publisher
University of Zielona Gora
ISSN
12343099
Authors (1)
N.R. Aravind
Department of Computer Science and Engineering
Recent publications
An FPT Algorithm for Matching Cut and d-Cut
Parameterized lower bounds and dichotomy results for the NP-completeness of H-free edge modification problems
Parameterized lower bound and np-completeness of some h-free edge deletion problems
On the expressive power of read-once determinants
Get all the updates for this publication
Follow