Monochromatic cycles in 2-edge-colored bipartite graphs with large minimum degree

Yiran Zhang; Yuejian Peng

doi:10.1016/j.disc.2024.114363

ScienceGate Book Chapters

JOURNAL ARTICLE

Monochromatic cycles in 2-edge-colored bipartite graphs with large minimum degree

Yiran Zhang Yuejian Peng

Year: 2024 Journal: Discrete Mathematics Vol: 348 (4)Pages: 114363-114363 Publisher: Elsevier BV

DOI: 10.1016/j.disc.2024.114363

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Combinatorics Monochromatic color Bipartite graph Colored Degree (music) Discrete mathematics Edge coloring Enhanced Data Rates for GSM Evolution Graph Line graph Computer science Graph power

Metrics

Cited By

4.92

FWCI (Field Weighted Citation Impact)

Refs

0.92

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

Monochromatic cycles in 2-edge-colored bipartite graphs with large minimum degree

Metrics

Citation History

Topics

Related Documents

Monochromatic Cycles in 2-edge-colored Bipartite Graphs

Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree

Large Monochromatic Components in Edge Colored Graphs with a Minimum Degree Condition

Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs

Partitioning 2-edge-coloured bipartite graphs into monochromatic cycles