Uw̒̃Ot_D̂܂Cꕔ́uʑ􉽊wIOt_v́CƂĂ鍑̌҂ȂǁCRɋȖʏ̊􉽂㐔ɌтLȕłDiɁCŒ肳ꂽȖʏɖߍ݉\ȃOtŜminor closedƂȂ邱ƂC ŋߗs̃Ot}Ci[_Ƌ֌W܂D̂ƂC̕ɋl͐EIɂ܂܂Ă悤łDj

āC̐̕Ƃ𕡐li鉡lwł́CYĂƎCȉ̂悤ɁCw@⌤҂ΏۂƂZ~i[JÂ邱Ƃɂ܂D

̕ɋ͂ǂǂQĂƍlĂ܂Diu]́̕Cȉ̘Aɂ낵肢܂Dj

{IȓCꏊ͉L̂ƂłDKvɉāCύX邩܂񂪁CׂẴy[WňēĂ\łD

• F13Cjior ؗjj15:00
• ꏊFlw lԉȊw QUK612iTK511C512ōsƂ܂j
• AFRi{j
• 8,911,12̓[~h⌤W̊֌WAZ~i[x݂邱Ƃ܂B

֘AURLF o[ꗗ | ʑ􉽊wIOt_W

## u

### 2017N1124()15:00--

u1
Ross Kang(Redbouc University Nijmegen)
^Cg
From a precoloured matching to a proper edge-colouring.
Tv
Precolouring extension has been intensively studied for a many decades. It became a hot topic in the 1990s after important works of Thomassen and Albertson. But a much more restricted problem, in the context of completing partial Latin squares, was studied since the 1960s in relation to a conjecture of Evans. Surprisingly, a very natural problem that interpolates between these two topics was not deeply studied until now. We study conditions that guarantee when a precoloured matching can be extended to a proper edge-colouring of the entire graph. There remain many attractive open questions. This is joint work with Edwards, Girao, van den Heuvel, Puleo, and Sereni.

## Nx̍u

### 2017N112()16:00--

u
Nastaran Haghparast(Amirkabir University of Technology)
^Cg
Even factor of graphs and edge-connectivity

### 2017N1027()15:00--

u1
đq^
^Cg
Minor relation for quadrangulations on closed surfaces
u2
RN({w)
^Cg
؂ɕӂOtɂHamiltonian number

### 2017N1013()15:00--

u
RFO
^Cg
H-distinguishing coloring

### 2017N106()15:00--

u
y򏫋
^Cg
P4-free graph ɂ graph grabbing game

### 2017N728()15:30--

u
Ƙai؍XÍjC]mi؍XÍj
^Cg
A characterization of tree-tree quadrangulations on closed surfaces

u
OVriŉYHƑwM2)
^Cg
f-leaf-treeɂ

### 2017N714()15:00--

u
RFOAYM
^Cg
3-dynamic coloring for planar triangulations

u
{(w)
^Cg
ӓIXgʐF\ȃOtɂ

### 2017N623()15:00--

u
mq(Louisiana Tech. Univ.)
^Cg
Quasi-surfaces: chromatic number and Euler formula

### 2017N616()15:00--

u
i
^Cg
3-3-AʓIOt̃NC{gւ̍Ė\

### 2017N69()15:00--

u
ؗLS(Vw)
^Cg
K_6-Minors in triangulations on the nonorientable surface of genus 4

### 2017N62()15:00--

u
x
^Cg
domatic number of cartesian product about Tree and Path

### 2017N526()15:00--

u
aI
^Cg
sp̂ЂƂ̑gݍ킹\

u
֌
^Cg
OtDP-ʐF

### 2017N512()15:00--

u
x
^Cg
domatic number of graphs

### 2017N428()15:00--

u
q
^Cg
Signature of k-edge-coloring of k-regular graphs

### 2017N421()15:00--

u
Seog-Jin Kim (Konkuk University)
^Cg
Nine Dragon Tree Conjecture
Tv
For a loopless multigraph $G$, the {\it fractional arboricity} $Arb(G)$ is the maximum of $\frac{|E(H)|}{|V(H)|-1}$ over all subgraphs $H$ with at least two vertices. Generalizing the Nash-Williams Arboricity Theorem, the Nine Dragon Tree Conjecture asserts that if $Arb(G)\le k+\frac{d}{k+d+1}$, then $G$ decomposes into $k+1$ forests with one having maximum degree at most $d$. In this talk, we introduce Nine Dragon Tree Conjecture and present recent results.

### 2017N414()15:00--

u
y򏫋`
^Cg
̓{̓ɂGraph Grabbing Game

ߋ̗

wOŊJÂĂOt_Eg_̃Z~i[łD