Partitioning 2-edge-colored graphs by monochromatic paths and cycles

József Balogh; János Barát; Dániel Gerbner; András Gyárfás; Gábor N. Sárközy

doi:10.1007/s00493-014-2935-4

ScienceGate Book Chapters

JOURNAL ARTICLE

Partitioning 2-edge-colored graphs by monochromatic paths and cycles

József Balogh János Barát Dániel Gerbner András Gyárfás Gábor N. Sárközy

Year: 2014 Journal: COMBINATORICA Vol: 34 (5)Pages: 507-526 Publisher: Springer Science+Business Media

DOI: 10.1007/s00493-014-2935-4

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Mathematics Monochromatic color Conjecture Vertex (graph theory) Disjoint sets Bipartite graph Colored Independence number Edge coloring Discrete mathematics Graph Graph power Line graph Physics

Metrics

Cited By

10.60

FWCI (Field Weighted Citation Impact)

Refs

0.99

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 Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

Graph theory and applications

Physical Sciences → Mathematics → Geometry and Topology

Partitioning 2-edge-colored graphs by monochromatic paths and cycles

Metrics

Citation History

Topics

Related Documents

Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees

Partitioning 2‐Edge‐Colored Ore‐Type Graphs by Monochromatic Cycles

Long monochromatic paths and cycles in 2-edge-colored multipartite graphs

Monochromatic paths in edge-colored graphs

Monochromatic Cycles in 2-edge-colored Bipartite Graphs