Note on highly connected monochromatic subgraphs in 2-colored complete graphs.
Fujita, Shinya; Magnant, Colton
The Electronic Journal of Combinatorics [electronic only] (2011)
- Volume: 18, Issue: 1, page Research Paper P15, 5 p., electronic only-Research Paper P15, 5 p., electronic only
- ISSN: 1077-8926
Access Full Article
topHow to cite
topFujita, Shinya, and Magnant, Colton. "Note on highly connected monochromatic subgraphs in 2-colored complete graphs.." The Electronic Journal of Combinatorics [electronic only] 18.1 (2011): Research Paper P15, 5 p., electronic only-Research Paper P15, 5 p., electronic only. <http://eudml.org/doc/223488>.
@article{Fujita2011,
author = {Fujita, Shinya, Magnant, Colton},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {large monochromatic subgraphs; highly connected subgraphs},
language = {eng},
number = {1},
pages = {Research Paper P15, 5 p., electronic only-Research Paper P15, 5 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Note on highly connected monochromatic subgraphs in 2-colored complete graphs.},
url = {http://eudml.org/doc/223488},
volume = {18},
year = {2011},
}
TY - JOUR
AU - Fujita, Shinya
AU - Magnant, Colton
TI - Note on highly connected monochromatic subgraphs in 2-colored complete graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2011
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 18
IS - 1
SP - Research Paper P15, 5 p., electronic only
EP - Research Paper P15, 5 p., electronic only
LA - eng
KW - large monochromatic subgraphs; highly connected subgraphs
UR - http://eudml.org/doc/223488
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.