On monochromatic subgraphs of edge-colored complete graphs

Eric Andrews; Futaba Fujie; Kyle Kolasinski; Chira Lumduanhom; Adam Yusko

doi:10.7151/dmgt.1725

ScienceGate Book Chapters

JOURNAL ARTICLE

On monochromatic subgraphs of edge-colored complete graphs

Eric Andrews Futaba Fujie Kyle Kolasinski Chira Lumduanhom Adam Yusko

Year: 2013 Journal: Discussiones Mathematicae Graph Theory Vol: 34 (1)Pages: 5-5 Publisher: De Gruyter Open

DOI: 10.7151/dmgt.1725

Get Full-Text PDF Get Analytical Report

Abstract

In a red-blue coloring of a nonempty graph, every edge is colored red or blue. If the resulting edge-colored graph contains a nonempty subgraph G without isolated vertices every edge of which is colored the same, then G is said to be monochromatic.

Keywords:

Monochromatic color Mathematics Colored Combinatorics Enhanced Data Rates for GSM Evolution Computer science Physics Artificial intelligence Optics

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.09

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

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

On monochromatic subgraphs of edge-colored complete graphs

Abstract

Metrics

Topics

Related Documents

Edge-colored complete graphs with precisely colored subgraphs

Highly connected monochromatic subgraphs of two-colored complete graphs

Monochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A Survey

Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring

Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs