Partitioning 3-coloured complete graphs into three monochromatic paths

Alexey Pokrovskiy

doi:10.1016/j.endm.2011.10.020

ScienceGate Book Chapters

JOURNAL ARTICLE

Partitioning 3-coloured complete graphs into three monochromatic paths

Alexey Pokrovskiy

Year: 2011 Journal: Electronic Notes in Discrete Mathematics Vol: 38 Pages: 717-722 Publisher: Elsevier BV

DOI: 10.1016/j.endm.2011.10.020

Get Full-Text PDF Get Analytical Report

Keywords:

Monochromatic color Combinatorics Mathematics Bipartite graph Disjoint sets Complete bipartite graph Conjecture Discrete mathematics Complete graph Graph Physics Optics

Metrics

Cited By

2.03

FWCI (Field Weighted Citation Impact)

Refs

0.82

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 applications

Physical Sciences → Mathematics → Geometry and Topology

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Partitioning 3-coloured complete graphs into three monochromatic paths

Metrics

Citation History

Topics

Related Documents

Partitioning edge-coloured complete graphs into monochromatic cycles and paths

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

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

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

Partitioning edge-coloured complete graphs into monochromatic cycles