## Nx܂łTGTZ~i[̗

### 2020N731()16:00--

u
i
^Cg
Ot̍Ė weak coloring

### 2020N626()17:00--

u
Carol Zamfirescu (Ghent University)
^Cg
Hamiltonian cycles and 1-factors in 5-regular graphs
Tv
The talk will revolve around proper edge-colourings of regular graphs in which certain colour pairs form hamiltonian cycles -- such a pair is called perfect. We will be particularly interested in the 5-regular case. We begin by presenting a theorem which solves Kotzig's problem asking whether planar 5-regular graphs exist admitting an edge-colouring in which all ten pairs are perfect. In fact, we show that the number of solutions to Kotzig's problem grows at least exponentially. In the second part of the talk, we focus on counting edge-colourings with a certain number of perfect pairs in planar 5-connected 5-regular graphs. In the last part of the presentation, we discuss edge-Kempe equivalence classes. This talk is based on joint work with Nico Van Cleemput.

### 2020N619()17:00--

u
OVr
^Cg
3-AʓIOt̃vYn~g\z̐VȔ

### 2019N1129()16:30--

u
RmL
^Cg
ʏ̎lp antirainbowness

### 2019N118()15:30--

u
Tomas Kaiser (West Bohemia University)
^Cg
Graph coloring and topology

u
Seung Jae Eom
^Cg
S4-conjecture

### 2019N911()16:00--

u
Andreas Schmid (Aalto University, Finland)
^Cg
Finding Long Cycles in Planar Graphs
Tv
In this talk I will introduce the concept of Tutte paths and how to use these special subgraphs in planar graphs to find long cycles in polynomial time. In general graphs this problem is known to be NP-hard.

### 2019N726()10:00--

u
c^G
^Cg
On-line coloring algorythms

### 2019N614()16:30--

u
Rq
^Cg
locally connected graphachromatic number

### 2019N531()16:30--

u
^Cg
steiner point p polygon ̎lp

### 2019N524()16:30--17:00

u
Gabor Wiener (Budapest University of Technology and Economic)
^Cg
Minimum leaf spanning trees of 2-connected cubic multigraphs

### 2019N524()17:00--17:30

u
Carol Zamfirescu (Ghent University)
^Cg
Grinberg's Criterion

u
i
^Cg
1-ʓIOt̍Ė\

u
RFO
^Cg
OtɊ܂܂H̒ƃOtʐF

### 2019N45()16:30--

u
i
^Cg
Ė facial complete coloring

### 2019N125()15:00--

u
Peter Zeman (Charles University in Prague)
^Cg
On H-topological intersection graphs
Tv
Biro, Hujter, and Tuza (1992) introduced the concept of H-graphs, intersection graphs of connected subregions of a graph H thought of as a one-dimensional topological space. They relate to and generalize many important classes of geometric intersection graphs, e.g., interval graphs, circular-arc graphs, split graphs, and chordal graphs. Surprisingly, we negatively answer the 25-year-old question of Biro, Hujter, and Tuza which asks whether H-graphs can be recognized in polynomial time, for a fixed graph H. Moreover, our paper opens a new research area in the field of geometric intersection graphs by studying H-graphs from the point of view of fundamental computational problems of theoretical computer science: recognition, graph isomorphism, dominating set, clique, and colorability.

### 2019N111()14:30--

u
q
^Cg
Differences among \chi, \chi_l, and \chi_{D.P.}

### 2018N127()16:30--17:00

u
rH
^Cg
4-AۂΊpόɂ

### 2018N119()16:30--

u
Jie Ma (University of Science and Technology of China)
^Cg
From counting lines to counting subgraphs
Tv
Given n points in the plane, how many straight lines can one add between pairs of points such that there is no triple of lines intersecting each other? The analog of this problem in graph theory provided a rich field for research, which remains to lie in the core of the extremal combinatorics even today. In this talk, we will give a brief introduction to some well-know results in this field and then discuss a generalization which recently receives considerable attentions: given two graphs T and H, to find the maximum number of T-copies in an n-vertex H-free graph. The talk will assume no prior knowledge of the topic and a broad audience (graduate students of general mathematical background, etc) are warmly welcome to come.

### 2018N1023()16:30--17:00

u
Gasper Fijavz
^Cg
Minimal graphs containing k perfect matchings

### 2018N1023()17:15--17:45

u
Seog-Jin Kim
^Cg
Introduction to signed coloring

### 2018N1012()15:00--

u
c@
^Cg
ʃOtimproper DP-coloring ɂ

### 2018N105()15:00--

u
RFO
^Cg
balancedness for spanning bipartite quadrangulations of triangulations

### 2018N720()16:30--

u
i
^Cg
ɑOʃOtɂc-self-domination

### 2018N713()16:30--

u
Gabor Wiener@(Budapest University of Technology and Economics, Hungary.)
^Cg
Minimum leaf spanning trees
Tv
Two natural generalizations of hamiltonicity are the path covering number (the minimum number of paths that cover the vertices of a graph) and the minimum leaf number (the minimum number of leaves of the spanning trees of a connected graph). We give upper bounds on the minimum leaf number of members of certain classes of graphs and introduce a concept that gives a common generalization of hypohamiltonicity and hypotraceability in the context of both the path covering number and the minimum leaf number. Finally we mention an application of the abovementioned concept.

### 2018N76()16:30--

u
rH
^Cg
Ȗʏ̎Op flippable edge ɂ

### 2018N629()16:30--

u
RN
^Cg
RDFS ALgorithm for cubic graphs

u
J
^Cg
Order demension

### 2018N615()16:30--

u
x
^Cg
TreeTree Domatic number

u
֌(l)
^Cg
1,2,3-conjecture

### 2018N61()16:30--

u
Y(l)
^Cg
DP-coloringList coloring

### 2018N518()16:30--

u
Zdenek Ryjacek(University of West Bohemia)
^Cg
Line graphs, claw-free graphs and closure operations
Tv
Graph closures became recently an important tool in Hamiltonian Graph Theory since the use of closure techniques often substantially simplifies the structure of a graph under consideration while preserving some of its prescribed properties (usually of Hamiltonian type). In the talk, we show basic ideas behind some closure operations and survey recent results on variations of closure concepts in line graphs and claw-free graphs and on stability of graph classes and graph properties with respect to these closure operations. We show some examples of closure-related proof techniques.

### 2018N511()16:30--

u
{(w)
^Cg
OpɂTuza\zɂ

### 2018N427()16:30--

u
Rq(l)
^Cg
ʏ̋Opface achromatic number

### 2018N420()16:30--

u
aI(l)
^Cg
tiling a polygon with parallelograms

u
{֍_(l)
^Cg
̒藝̏ؖƕς

u
i(lM2)
^Cg
4-LOt̖ߍ

### 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.

### 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

### 2016N1814:00--

u
x(lwHw)
^Cg
xzƎxzFɂ
u2
q, ÏK(lwHw)
^Cg
ɑOˉeʓIOtdomination numberɂ

### 2015N122514:00--

u
q, ÏK(lwHw)
^Cg
ɑOˉeʓIOtdomination numberɂ

### 2015N112716:00--(ꏊ:lԉȊw511)

u
Thomas Hull(Western New England University)
^Cg
܂莆wƂ̉p
Tv
{uł,􉽊w,gݍ_,㐔܂,܂莆ɉBꂽwTK.܂,Ȃ̃AJ̉Ȋw҂Zp҂{bgHwimeNmW[ւ̉p̂߂ɐ܁E莁Eɋ̂ɂďqׂ.

### 2015N1120

u
J (lww{j
^Cg
Dominator coloringɂ
Tv
{uł, ̐sɂĒmĂOtdominator coloringɂďЉ.

### 2015N103014:00--

u
(w)
^Cg
Kempe equivalent classes of 3-edge-colorings in cubic bipartite graphs on the projective plane
Tv
ˉeʏ 3- 2Ot 3-ӍʐF Kempe lނl. ,̃NXł͎ˉeʂ̊􉽂猈܂铯lނ݂邱Ƃ.

### 2015N1016

u
LYilww{j
^Cg
Reductions of quadrangulations of the sphere with minimum degree 3
Tv
ʏ̍ŏ3ȏ̎lpɂA}Ci[֌WۂkЉ.

### 2015N8716:00

u
Jinko Kanno *( Louisiana Tech University), Stacey McAdams( Louisiana Tech University)
^Cg
Oriented Book Embeddings of Directed Graphs
Tv
--

### 2015N717ij13:30--

u
x(lEwHw)
^CEg
xzDominator coloring̊֌Wɂ
Tv
--

### 2015N710()13:30--

u
ilww{j
^Cg
2̊_ʏ̎OpN-flipɂ
u2
{(wHw)
^Cg
3-ӋɑȋȖʏ̃Ot̗LɂE
Tv
xzEk̘AOtGk-ӋɑłƂ́AG̔Cӂ̔אڂQ_ɕӂǉēCӂ̃OtHɂāA̎xzk-1ƂȂ邱ƂłB {uł́ACӂ̕Ȗʏ3-ӋɑȃOťLł邱ƂؖB

### 2015N73()13:30--

u
LYilww{j
^Cg
ʏ̎lpɂ}Ci[֌Wɂ
Tv
--

### 2015N612ij13:30--

u
J ilww{j
^Cg
Flipping edges on triangulations
Tv
􉽓IȑpɂOpɂ,Ίpό̉񐔂Љ.

### 2015N65Eij13:30--

u
{(wHw)
^Cg
3,4-p̑Ίpόɂ
Tv
3,4-pƂ́AʁE̊eʂ34̕HɂĈ͂܂ĂAPOt̂ƂłB{uł́A_Cӂ̓3,4-pA_ɊւI[_[̑ΊpόɂČ݂Ɉڂ荇ƂEؖB

### 2015N529ij13:30--

u
J (lww@w{)
^Cg
Poset̐gɂ
Tv
WɂgƂ,Wɂrs\΂ɔCӂ̏^ĂƂŔSɂł.ʂɂ,gœꂽ́ES,ƂȂ锼W𕜌邱Ƃ͍ł邪,̑Sp邱Ƃ,̕\ƂȂ. ,锼WE𕜌邽߂ɕKvƂȂS̍ŏɂ,EEWȂOtpďؖ.
u2
đq ^(lww@w{)
^Cg
ˉeʏ̎lpɂK_{3,4}-minorɂ(2)
Tv
--

### 2015N52214:00--

u
(lww@w{)
^Cg
2̊_ʏ̎OpN-flipɂ
Tv
N-flipƂ,Opʂ̎Opɕό鑀̂Ƃł. N-flipɂ,ʏ̒_, color factořƂȂ2̊_OpN-flipɂ,݂Ɉڂ荇Ƃؖ.

### 2015N515ij 14:00--

u
LES(Vww)
^Cg
K_7-minors in optimal 1-planar graphs
Tv
Optimal 1-planar graphƂ́C1-planar graph̒ł̕Ӑ̏E^Ot̂ƂłD{ułoptimal1-planar graph$K_7$-minorȂ߂̕Kv\ЉD

### 2015N58ij 14:00--

uE
J (lww@Ew{)
^Cg
Zero-divisor graphۑlattice̕όɂ
Tv
LatticeƂ, ȍ\posetł. LatticeȂzero-divisor graph̕Kv\ɂEĂ, zero-divisor graphۑlattice̕όɂďؖ.

### 2015N51ij 15:00--

u
đq ^ (lww@w{)
^Cg
ˉeʏ̎lpEɂK_{3,4}-minorEɂ(1)
u2
q (lwHw)
^Cg
ɑOˉeʓIOtdomination number

### 2015N424ij13:30--

u
(w)
^Cg
Signed OtƎˉeʏ̃Ot̊֌W
Tv
--

### 2015N410ij14:00--

u
YM (lww@w{)
^Cg
N-flips in 4-chromatic even triangulations on the projective plane
Tv
N-flipƂ,Opʂ̋Opɕό鑀̂Ƃł. N-flipɂ,Eˉeʏ̒EE_4-chromatic even triangulation݂Ɉڂ荇Ƃؖ.

u
LSiVw wj
^Cg
񕔃OtI1-planarOt̕Ӑ
u2
ilw񌤋@j
^Cg
ʓIOt̑̕Ȗʏ̒Ȗߍ

### 2015N130ij13:30--

u
J ilww@w{j
^Cg
Schnyder labeling and woods
u2
{ ֍_ilw񌤋@j
^Cg
ʎOp3-orientation̋Ǐόɂ

### 2015N123ij13:30--

u
{ ȁiE񌤋@qj
^Cg
ʏ(3,4)-pɂΊpό́E񐔂ɂ
Tv
ʏ(3,4)-pƂ́COpʂƎlpʂȂ2-AȒPOt̂ƂłD {uł́C _ƎOpʂ̐Cӂ2̋ʏ(3,4)-p_ɊւĐI[_[̉񐔂̑ΊpόɂČ݂Ɉڂ荇ƂؖD

### 1212ij15:00--

u
{ ȁi񌤋@qj
^Cg
Ȗʏ̋Opɂ Grünbaum coloring ɂ
u2
LYilwHw4Nj
^Cg
kɂ鋅ʏ̎lp̔֌Wɂ

### 125ij13:30--

u
{ ȁi񌤋@qj
^Cg
_ǉɂOt̕όpOt̎xzɊւؖɂ

### 1114ij13:30--

u1
iwj
^Cg
Ȗʏ̗̈IQ[ɂ
u2
YMilww@w{j
^Cg
ˉeʏ̋OpɂFۑN-flipɂ

### 1024ij13:30--

u
icmwK⌤j
^CgEE/dt>
ǏʓI Fisk triangulation Grünbaum coloring ɂ
Tv
uSȖʂƂDS̔Cӂ̋ǏʓIOpǴCGrünbaum coloring DvƂ Robertson ̗\zD ̗\źC4-ʐF\Gɑ΂Ă͐藧ƂeՂɂ킩D {uł́C5-FIȎOpƂĒmĂ Fisk triangulation ̑ɑ΂C ̗\z藧ƂD

### 1010ij13:30--

u
J ilww@w{j
^Cg
Zero-diviser graphs of Lattices
u2
R FOilwHw4Nj
^Cg

### 103ij15:00--

u
Gelasio SalazariUniversidad Autonoma de San Luis Potosij
^Cg
Planar drawings of projective graphs
Tv
--

### 718ij13:30--

u
R FOilwHw4Nj
^Cg

Tv
{uł́C Cӂ̂傤2̊_܂ޕʎOpC 5_Opނ̋ǏόɂĐł邱ƂؖD

u
{ ȁi񌤋@qj
^Cg
--
Tv
--

### 2014N66ij13:30--

u
icmwK⌤j
^Cg
Local chromatic number of quadrangulations of surfaces
Tv
OtGlocal r-coloringƂ́CG̒_ʐF̂CCӂ̒_̋ߖTɍXr-1F̂D Glocal r-coloringr̍ŏlGlocal chromatic numberƂC(G)ŕ\D {uł́C ȖS̎lpĜ(G)<(G)ƂȂ鑰ɂčl@D

### 2014N530ij13:30--

u
J ilww@w{j
^Cg
Poset̕όɂ
Tv
^ȃOtboundOtƂĂPosetԂ̕όɂčuD

### 2014N523ij16:30--

u
iwj
^Cg
Tutte path̏ؖɂ
Tv
{uł́CTutte pathɊւ藝̏ؖɂĐD

### 2014N425ij13:30--

u
Eric Colin de VerdiereiEcole normale superieure and CNRSj
^Cg
Topological algorithms for graphs on surfaces
Tv
Let G be a (weighted) graph drawn without crossings on a surface S. We consider the following algorithmic problems:
(1) Compute a shortest (minimum-weight) cycle in G that is non-contractible in S;
(2) compute a shortest subgraph H of G such that cutting S along H gives a topological disk;
(3) given a walk w in G, compute a shortest walk homotopic to it (i.e., which can be obtained from w by a continuous deformation on S).
The aim of this talk is to survey techniques for solving such topological problems, connected to the fields of topological graph theory, computational topology, and graph algorithms. These questions are also motivated by applications in computer graphics and geometric modelling, where parameterizing or simplifying a surface mesh is useful in several contexts.

### 2014N418ij13:30--

u1
Iilww@w{j
^Cg
ˉeʏ5-AOpMatching extensionɂ
Tv
G 2m+2 _ȏ̊S}bOOtƂD ŁCG ̃}bO M ŁC|M|=m M ̂ǂ2ӂ d ȏ㗣Ă̂ǂ̂悤ɎĂ M ܂ G ̊S}bO݂鎞CG ͋d-mgIł ƂD{uł́Cˉeʏ5-AOpɂ鋗3-7gɂčl@D
u2
đq ^ilww@w{j
^Cg
ˉeʏ̎lpɂ}Ci[֌W
Tv
{uł́Cȉ̒藝ؖD

### 2014N411ij16:30--

u
J ilww@w{j
^Cg
PosetɊւbound graph
Tv
PosetiWjɊւintersection graph̏Ɋւ錋ʂɂďЉD

### 2014N328ij13:30--

u
Gasper FijavziUniversity of Ljubljanaj
^Cg
Threshold coloring
Tv
--

### 2014N327i؁j13:30--

u
㐶ilw񌤋@j
^Cg
3-regular maps on closed surfaces are nearly distinguishing 3-colorable with few exceptions
Tv
--

### 2014N325i΁j10:30--

u
{ȁilww{j
^Cg
ˉeʏ̓񕔃OtIlpɂ}Ci[֌Wɂ
Tv
--

u
^Cg
--
Tv
--

### 2014N123i؁j16:30--

u
YMilww@w{j
^Cg
g[X̑dOpɂFۑN-flipɂ
Tv
--

u
VFVilww@w{j
^Cg
ˉeʏ̖{^ߍ݂ɂ
Tv
{ł́Cȉ̒藝̏ؖsD

### 2013N1129ij16:30--

u
씎Iilww@w{j
^Cg
Edge proximity condition for extendability in projective planar triangulations
Tv
G 2m+2 _ȏ̊S}bOOtƂD ŁCG ̃}bO M ŁC|M|=m M ̂ǂ2ӂ d ȏ㗣Ă̂ǂ̂悤ɎĂ M ܂ G ̊S}bO݂鎞CG ͋d-mgIł ƂD{uł́Cˉeʏ̎Opɂ鋗d-mgɂčl@D

### 2013N111ij17:00--

u
{ȁilww@w{j
^Cg
ӓIɕ3-ʐF\ȃOtɊւ\zɂ
Tv
OtGӓIɕ3-ʐF\łƂ́CGF̒u𖳎Ăʂ̕3-ʐFƂD {uł́CӓIɕ3-ʐF\ȃOtɊւ\zɂďЉD

### 2013N1024i؁j16:30--

u
䐒 ilwlԉȊw B4j
^Cg
Oplp̐ɂ
Tv
ʏ̎lpOpɂ鐶藝ɂčl@D

### 2013N1017i؁j16:30--

u(1)
{ȁilww@w{j
^Cg
Ȗʏ̎Opɂxzɂ
u(2)
icmww@j
^Cg
Ȗʏ̎Op瓾񕔃OtIłȂlpɂ

### 2013N1011ij16:30--

Eu
͐qqilww@w{j
^Cg
ˉeʏ̎Op Grunbaum coloring ɂPFOtɂ
Tv
Op Grunbaum coloring Ƃ́CSĂ̎OpʂɈقȂOF悤ȕӒF̂ƂłD {uł́Cˉeʏ̎Op Grunbaum coloring ɂeF̒PFOtAɂȂ邽߂̕Kv\ɂčl@D

### 2013N104ij16:30--

u(1)
{֍_ilw񌤋@j
^Cg
How to find an independent set
u(2)
icmww@j
^Cg
Ȗʏ̎Op瓾lp

### 2013N726ij16:30-- iOŏIj

u
͐qqilww@w{j
^Cg
ʎOp Grunbaum coloring ɂPFOtɂ
Tv
Op Grunbaum coloring Ƃ́CSĂ̎OpʂɈقȂOF悤ȕӒF̂ƂłD {uł́C Grunbaum coloring ɂeF̒PFOtAɂȂ邽߂̕Kv\ɂčl@D

### 2013N628ij16:30--

u
Michal KotrbcikiKomenius Universityj
^Cg
--
Tv
--

### 2013N620i؁j16:30--

u
icmww@j
^Cg
Monodromy of even triangulations on surfaces
Tv
MonodromyEƂ́CȖʏ̋Opɑ΂ĒTOłD {uł́CmonodromẙbCtɂĂ̍l@sD

### 2013N613i؁j16:30--

u
VFVilww@w{j
^Cg
t\ȕȖʏ̃Ot̖{^ߍ݂ɂ
Tv
{ł́Cȉ̒藝̏ؖsD

### 2013N531ij16:30--

u
YMilww{j
^Cg
Ȗʏ̑dOpɂFۑN-flipɂ
Tv
Cӂ̕Ȗʏ̒_\ɑ傫OpN-flipɂČ݂Ɉڂ荇߂ɂ́A monodromyƌĂ΂sϗʂƂKv\ł邱ƂmĂB {uł́A dӂOpɂāA FۑN-flipɂĈڂ荇Ƃɂċc_B

### 2013N523i؁j16:30--

u
{֍_i񌤋@j
^Cg
Grunbaum coloring of even triangulations on surfaces
Tv
Op Grunbaum coloring Ƃ́CSĂ̎OpʂɈقȂOF悤ȕӒF̂ƂłD {uł́Cg[X̑SĂ̋Op Grunbaum coloring ƂC ܂̕Ȗʏ̋OpɂĂ̍l@sD

### 2013N516i؁j16:30--

u
Michal KotrbcikiKomenius Universityj
^Cg
Embeddings of graphs on surfaces
Tv
--

### 2013N412ij16:30--

u
{ȁilww@w{j
^Cg
ʏ̌܊pɂΊpό̉
Tv
ȉ̒藝ؖB

### 2013N38ij16:30--

u
n ilww@ w{ M1j
^Cg
Ȗʏ̌܊p銮SOtcurrent graphɂ
Tv
current graphƂ́A^ꂽOt̂Ȗʂւ̖ߍ݂邽߂ɍ\dݕtLOtłB {uł́At\ȕȖʂɂČ܊p^銮SOtcurrent graph̐ɂċc_B ܂Ats\ȕȖʂ̏ꍇɂĂl@sB

### 2013N28ij16:30--

u
{ȁilww@ w{ D2j
^Cg
The number of triangles in uniquely 3-colorable planar graphs U
Tv
ʓIOt G F̒ûƂŁAʂk-_ʐFƂA G uniquely k-colorable łƂB {uł́AOɈA uniquely 3-colorable ȕʓIOtɂOp̌Ɋւ邢̐sƌʂЉA ŏɊւ鐧ɂĂ̏ؖsB

### 2013N118ij14:30--17:00

u
{ȁilww@ w{ D2j
^Cg
The number of triangles in uniquely 3-colorable planar graphs
Tv
ʓIOt G F̒ûƂŁAʂk-_ʐFƂA G uniquely k-colorable łƂB {uł́A uniquely 3-colorable ȕʓIOtɂOp̌Ɋւ邢̐sƌʂЉA ̏ؖsB

### 2012N1122i؁j17:00--

u
YME{ȁilww@ w{j
^Cg
Ȗʏ̑dOpɂFۑN-flipɂ
Tv
Cӂ̕Ȗʏ̒_\ɁE傫OpN-flipɂČ݂Ɉڂ荇߂ɂ́A monodromyƌĂ΂sϗʂƂKv\ł邱ƂmĂB {uł́A dӂOpɂāA FۑN-flipɂĈڂ荇Ƃɂċc_B

### 2012N1025i؁j17:00--

u
icmw Hwȁj
^Cg
ElpOp
Tv
t\ȖʂɂāCCӂ̎lp͊eʂɑΊpӂ邱Ƃɂ OpɊgł邱ƂmĂD{uł́Cts\Ȗ ɂĂľʂ藧ƂD܂Ct\Es\̏ ɂĊg̎dʂ肠邩ɂċc_D

u
{֍_ilw 񌤋@j
^Cg
lpOp
Tv
--

### 2012N726i؁j16:30--

u
{ȁilww@ w{j
^Cg
The size of edge-critical uniquely 3-colorable planar graphs
Tv
ʓIOt G F̒ûƂŁAʂk-_ʐFƂA G uniquely k-colorable łƂB ܂Auniquely k-colorable ł镽ʓIOt G ̔Cӂ̕ e ɑ΂AG-e uniquely k-colorable łȂƂA G edge-critical łƂB {uł́Aedge-critical uniquely k-colorable ȕʓIOt̕Ӑ̏EɊւ錋ʂƂ̏ؖЉB

### 2012N68ij16:30--

u
򏁁icmw wj
^Cg
Ȗʏ̃Ot̃}bOgɂ
Tv
G 2m+2 _ȏ̊S}bOOtƂB ŁAG ̃}bO M ŁA|M|=m M ̂ǂ2ӂ d ȏ㗣Ă̂ǂ̂悤ɎĂ M ܂ G ̊S}bO݂鎞AG ͋d-mgIł ƂB{uł́Ag[X5-AOpCӂ m ɑ΂5-mgIł邱ƂB܂Al̋c_ NC{g5-AOpɂčsB

### 2012N525ij17:30--

u
㐶ilE񌤋@j
^Cg
Bipartite planar coverings and even embeddings of graphs on the projective plane
Tv
ʔ핢\źuAOtˉeʓIł邽߂̕Kv\͗L̕ʓI핢Ƃłv Ƃ\zŁA1986Nɍオ񏥂ĈȗAʑ􉽊wIOt_̖ȓ̂PƂČꂢB ŁA\zɂ镽ʓI핢񕔃OtɂȂƂƁA邩ɂčl@B ɁAOtˉeʏɋp݂̈̂Ȃ閄ߍ݂߂̏B

### 2012N46ij16:30--

u
ƘailEw{j
^Cg
3-AʓIOt̎ʐFɂ
Tv
Ot̑Ώ̐j󂷂悤Ȓ_ʐFɂF̍ŏlOt̎ʐFƂD ́CʓIOt̐FƎʐF̍ɒڂʂƁC̏ؖЉD

### 2011N610ij16:30--

u
yĈiw{D3j
^Cg
Ȗʂ̎OpHISTɂ
Tv
ȉ2̖ؖD
1, representativity\ɍ΁CCӂ̕Ȗʂ̎OpHIST.
2, 7essential cycle Ȃk-holed triangulation HIST.

### 2011N513ij15:00--

u
yĈiw{D3j
^Cg
퐔3̌ts\ȕȖʂ̎OpHISTɂ

### 2011N224i؁j16:00--

u
{ȁiw{M1j
^Cg
ʏ̎lp̑Ίpό̉񐔂ɂ

### 2010N1015ij15:00--

u
YMiwM2j
^Cg
FۑpONό(2)

### 2010N826i؁j13:00--

u(1)
āiw{M2j
^Cg
V^Ci[_plpɂ
u(2)
YMiwM2j
^Cg
FۑpONό

### 2010N723ij14:00--

u(1)
{ȁiw{M1j
^Cg
ʏ̘Zp̑Ίpό
u(2)
Mmiw{M2j
^Cg
rEX̑тƃNC̎̚OpHISTɂ
u(3)
͔͋viwM2j
^Cg
lpn̒_̏E

### 2010N75ij15:00--

u
͔͋viwM2j
^Cg
Op̒_̏E(3)

u
{ȁiM1j
^Cg
ʂ̘Zpɂ

u
֌(w)
^Cg
̓_fȊH߂̕Kv\

### 2010N528ij16:30--

u
yĈiD2j
^Cg
rEX̑т̎Op􉽊wI߂̕Kv\

u(1)
YMiwM2j
^Cg
dӂpɂ
u(2)
]milwPDj
^Cg
forestɂ

u
R{ilwj
^Cg
ʂ̌܊pɂ

### 2010N57ij15:00--

u
MmiM2j
^Cg
NC̒ق̎OpHISTɂ (2)

### 2010N423ij16:00--

u
yĈiD2j
^Cg
rEX̑т̎Op̊􉽊wIɂ

u
MmiM2j
^Cg
NC̒ق̎OpHISTɂ(1)

### 2010N414ij15:00--

u
쑾iM2j
^Cg
Drawing disconnected graphs on the Klein bottle (3)

### 2010N49ij15:30--

u
Xilwj
^Cg
Ȗʏ̎Op̑Ίpό

### 2010N323i΁j13:00--

u
͔͋viwM1j
^Cg
Op̒_̏E(2)

### 2010N319ij15:00--

u
쑾iM1j
^Cg
Drawing disconnected graphs on the Klein bottle (2)

u
͔͋viwM1j
^Cg
Op̒_̏E(1)

### 2010N216ij15:00--

u
쑾iM1j
^Cg
Drawing disconnected graphs on the Klein bottle (1)

### 2009N123ij16:30--

u
ؗLSi߉j
^Cg
Y-rotations in k-minimal quadrangulations on the projective plane
Tv
uˉeʏ̎lpface-contractionɊւċɏȂ̂ǂiedge-width k-minimalj Y-rotationJԂƂɂ݂Ɉڂ肠Dv L̖ؖDik ̏ꍇ𒆐SɏؖsDj

### 2008N1211i؁j16:30--

u
]m(D2)
^Cg
K6-Minors in triangulations on the nonorientable surface of genus 3

### 2008N1023i؁j16:00--

u(1)
{֍_ilEj
^Cg
u(2)
ؗLSi߉j
^Cg
Optimal 1-planar graph (O1PG) ̖ߍ݂̈Ӑɂ
Tv
uO1PG ͂̋ɏȂ̂āCʂւ̖ߍ ijӓIłDv
L̖C O1PG ̐藝pċA[@ɂؖD

### 2008N730ij13:00--

u(1)
ؗLSi߉j
^Cg
Tv
Ȗʏ̎lpɖʏkƂ𓱓D ̖ʏkɊւȉ̒藝̏ؖsD

u(2)
͗ь(w)
^Cg
Grotzsch's Theorem and its applications.
Tv
uł́Cŋ߂Grotzsch's Theoremӂ ŐVʂƗ\zЉDƂRobin ThomasƂ̃O[vɂ Ȗʏɖߍ܂ꂽOtւ̊giISAACł̘bjC āCThomassenƍu҂ɂgƁCȖʏɖߍ܂ꂽOtւ pЉD

### 2008N710i؁j16:30--

u
㐶ilEj
^Cg
Distinguishing number and faithful embedding of graphs on surfaces
Tv
Ot̑Ώ̐󂷂悤ɒ_ɉނ̃x蓖ĂD ̂ƂɕKvȃx̎ނ̍ŏOt̎ʐƂD {Cʐ͒ۃOtɑ΂ĒĂ̂C Ot̖ߍ݂̒c_邱ƂŁC ʑ􉽊wIOt_̎@g_WJ邱ƂłD ̗_𑍊藝ЉD

u
{֍_ilEj
^Cg