Note on 2-edge-colorings of complete graphs with small monochromatic k-connected subgraphs

Zemin Jin; Yuling Wang; Shili Wen

doi:10.1007/s11766-014-2859-1

ScienceGate Book Chapters

JOURNAL ARTICLE

Note on 2-edge-colorings of complete graphs with small monochromatic k-connected subgraphs

Zemin Jin Yuling Wang Shili Wen

Year: 2014 Journal: Applied mathematics/Applied Mathematics. A Journal of Chinese Universities/Gao-xiao yingyong shuxue xuebao Vol: 29 (2)Pages: 249-252 Publisher: Springer Nature

DOI: 10.1007/s11766-014-2859-1

Get Full-Text PDF Get Analytical Report

Keywords:

Monochromatic color Combinatorics Conjecture Mathematics Enhanced Data Rates for GSM Evolution Discrete mathematics Physics Computer science Optics Telecommunications

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.12

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Note on 2-edge-colorings of complete graphs with small monochromatic k-connected subgraphs

Metrics

Citation History

Topics

Related Documents

2-Colorings of complete graphs with a small number of monochromatic K4 subgraphs

Note on Highly Connected Monochromatic Subgraphs in $2$-Colored Complete Graphs

Rainbow Subgraphs in Edge-Colorings of Complete Graphs

Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring

Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number