Department Seminars & Colloquia

Category 학과 Seminar/ Colloquium
Event Discrete Math
Title Finding a spanning Halin subgraph in 3-connected {K_{1,3}, P_5}-free graphs
Abstract

A Halin graph is constructed from a plane embedding of a tree whose non-leaf vertices have degree at least 3 by adding a cycle through its leaves in the natural order determined by the embedding. In this talk, we prove that every 3-connected {K_{1,3},P_5} -free graph has a spanning Halin subgraph. This result is best possible in the sense that the statement fails if K_{1,3} is replaced by K_{1,4} or P_5 is replaced by P_6. This is a joint work with Guantao Chen, Jie Han, Songling Shan, and Shoichi Tsuchiya.

Daytime 2014-08-28 (Thu) / 16:00 ~ 17:00 ** 날짜에 유의하세요. **
Place 자연과학동 E6-1, ROOM 1409
Language To be announced
Speaker`s name Suil O
Speakers`s Affiliation Georgia State University, USA
Speaker`s homepage
Other information
Hosts 엄상일, Andreas Holmsen, 김연진
URL http://mathsci.kaist.ac.kr/~sangil/seminar/entry/20140828/
담당자
연락처