Complexity of two coloring problems in cubic planar bipartite mixed graphs

Bernard Ries

doi:10.1016/j.dam.2009.10.016

ScienceGate Book Chapters

JOURNAL ARTICLE

Complexity of two coloring problems in cubic planar bipartite mixed graphs

Bernard Ries

Year: 2009 Journal: Discrete Applied Mathematics Vol: 158 (5)Pages: 592-596 Publisher: Elsevier BV

DOI: 10.1016/j.dam.2009.10.016

Get Full-Text PDF Get Analytical Report

Keywords:

Bipartite graph Mathematics Combinatorics Planar graph Planar Edge coloring Graph coloring Discrete mathematics Graph Line graph Computer science Graph power

Metrics

Cited By

1.03

FWCI (Field Weighted Citation Impact)

Refs

0.81

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Optimization and Search Problems

Physical Sciences → Computer Science → Computer Networks and Communications

Scheduling and Optimization Algorithms

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Complexity of two coloring problems in cubic planar bipartite mixed graphs

Metrics

Citation History

Topics

Related Documents

Star coloring bipartite planar graphs

Hard coloring problems in low degree planar bipartite graphs

Weighted coloring on planar, bipartite and split graphs: Complexity and approximation

Complexity of the oriented coloring in planar, cubic oriented graphs

Circular Coloring of Signed Bipartite Planar Graphs