Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles

Oliver Schaudt; Maya Stein

doi:10.1016/j.endm.2015.07.052

ScienceGate Book Chapters

JOURNAL ARTICLE

Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles

Oliver Schaudt Maya Stein

Year: 2015 Journal: Electronic Notes in Discrete Mathematics Vol: 50 Pages: 313-318 Publisher: Elsevier BV

DOI: 10.1016/j.endm.2015.07.052

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Monochromatic color Mathematics Multipartite Disjoint sets Bipartite graph Vertex (graph theory) Partition (number theory) Cograph Discrete mathematics Graph 1-planar graph Chordal graph Physics

Metrics

Cited By

1.31

FWCI (Field Weighted Citation Impact)

Refs

0.83

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

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

Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles

Metrics

Citation History

Topics

Related Documents

Partitioning two‐coloured complete multipartite graphs into monochromatic paths and cycles

Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles

Partitioning edge-coloured complete graphs into monochromatic cycles and paths

Partitioning edge-coloured complete graphs into monochromatic cycles

Partitioning 3-coloured complete graphs into three monochromatic paths