Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs

Hebert Coelho; Luérbio Faria; Sylvain Gravier; Sulamita Klein

doi:10.1016/j.dam.2015.06.023

ScienceGate Book Chapters

JOURNAL ARTICLE

Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs

Hebert Coelho Luérbio Faria Sylvain Gravier Sulamita Klein

Year: 2015 Journal: Discrete Applied Mathematics Vol: 198 Pages: 109-117 Publisher: Elsevier BV

DOI: 10.1016/j.dam.2015.06.023

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Mathematics Bipartite graph Discrete mathematics Degree (music) Bounded function Graph power Edge coloring Planar graph Graph coloring Graph Line graph

Metrics

Cited By

0.33

FWCI (Field Weighted Citation Impact)

Refs

0.68

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs

Metrics

Citation History

Topics

Related Documents

Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs

Planar acyclic oriented graphs

Sum Coloring of Bipartite Graphs with Bounded Degree

Acyclic Edge Coloring of Chordal Graphs with Bounded Degree

Complexity of the oriented coloring in planar, cubic oriented graphs