JOURNAL ARTICLE

Partitioning Complete Bipartite Graphs by Monochromatic Cycles

Penny Haxell

Year: 1997 Journal:   Journal of Combinatorial Theory Series B Vol: 69 (2)Pages: 210-218   Publisher: Elsevier BV
Keywords:
Bipartite graph Combinatorics Vertex (graph theory) Monochromatic color Partition (number theory) Complete bipartite graph Mathematics Existential quantification Set (abstract data type) Discrete mathematics Graph Computer science Physics Optics

Metrics

62
Cited By
1.29
FWCI (Field Weighted Citation Impact)
9
Refs
0.68
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

Related Documents

JOURNAL ARTICLE

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

Richard LangOliver SchaudtMaya Stein

Journal:   Electronic Notes in Discrete Mathematics Year: 2015 Vol: 49 Pages: 787-794
JOURNAL ARTICLE

Partitioning 2-edge-coloured bipartite graphs into monochromatic cycles

Fabrício BenevidesArthur Lima QuintinoAlexandre Talon

Journal:   European Journal of Combinatorics Year: 2025 Vol: 130 Pages: 104192-104192
JOURNAL ARTICLE

Partitioning edge-coloured complete graphs into monochromatic cycles

Alexey Pokrovskiy

Journal:   Electronic Notes in Discrete Mathematics Year: 2013 Vol: 43 Pages: 311-317
JOURNAL ARTICLE

Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles

Tomasz ŁuczakVojtěch RödlEndre Szemerédi

Journal:   Combinatorics Probability Computing Year: 1998 Vol: 7 (4)Pages: 423-436
© 2026 ScienceGate Book Chapters — All rights reserved.