Hard coloring problems in low degree planar bipartite graphs

Miroslav Chlebík; Janka Chlebı́ková

doi:10.1016/j.dam.2006.03.014

ScienceGate Book Chapters

JOURNAL ARTICLE

Hard coloring problems in low degree planar bipartite graphs

Miroslav Chlebík Janka Chlebı́ková

Year: 2006 Journal: Discrete Applied Mathematics Vol: 154 (14)Pages: 1960-1965 Publisher: Elsevier BV

DOI: 10.1016/j.dam.2006.03.014

Get Full-Text PDF Get Analytical Report

Keywords:

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

Metrics

Cited By

0.67

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

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Hard coloring problems in low degree planar bipartite graphs

Metrics

Citation History

Topics

Related Documents

Star coloring bipartite planar graphs

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

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

Circular Coloring of Signed Bipartite Planar Graphs

Complexity of two coloring problems in cubic planar bipartite mixed graphs