Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles

Richard Lang; Oliver Schaudt; Maya Stein

doi:10.1016/j.endm.2015.06.106

ScienceGate Book Chapters

JOURNAL ARTICLE

Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles

Richard Lang Oliver Schaudt Maya Stein

Year: 2015 Journal: Electronic Notes in Discrete Mathematics Vol: 49 Pages: 787-794 Publisher: Elsevier BV

DOI: 10.1016/j.endm.2015.06.106

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Mathematics Monochromatic color Bipartite graph Complete bipartite graph Disjoint sets Vertex (graph theory) Upper and lower bounds Complete graph Discrete mathematics Cograph Graph 1-planar graph Chordal graph Physics

Metrics

Cited By

2.63

FWCI (Field Weighted Citation Impact)

Refs

0.90

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

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

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles

Metrics

Citation History

Topics

Related Documents

Partitioning 2-edge-coloured bipartite graphs into monochromatic cycles

Partitioning edge-coloured complete graphs into monochromatic cycles

Partitioning edge-coloured complete graphs into monochromatic cycles and paths

Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles

Partitioning Complete Bipartite Graphs by Monochromatic Cycles