受賞国：アメリカ合衆国

記述言語：英語   掲載種別：研究論文（学術雑誌）  

記述言語：英語   掲載種別：研究論文（学術雑誌）  

記述言語：英語   掲載種別：研究論文（学術雑誌）  

記述言語：英語   掲載種別：研究論文（学術雑誌）  

記述言語：英語   掲載種別：研究論文（学術雑誌）  

記述言語：英語

開催年月日： 2015年1月

記述言語：英語   会議種別：口頭発表（一般）  

国名：アメリカ合衆国  

開催年月日： 2014年10月

記述言語：英語   会議種別：口頭発表（招待・特別）  

国名：アメリカ合衆国  

開催年月日： 2013年3月

記述言語：英語   会議種別：口頭発表（一般）  

国名：アメリカ合衆国  

Every connected graph G contains a closed walk in which every vertex in G appears at least once. Such a walk is a (vertex) covering walk in G. In particular, a shortest such walk is called a Hamiltonian walk in G and its length is called the Hamiltonian number of G. These concepts were introduced by S. E. Goodman and S. T. Hedetniemi in 1973 and have been studied by many. Some recent results and related topics in this area will be discussed.

開催年月日： 2012年11月

記述言語：英語   会議種別：口頭発表（一般）  

国名：日本国  

There have been numerous studies using a variety of methods for the purpose of uniquely identifying the vertices of a graph or distinguishing two vertices whenever they are adjacent. Naturally, many of these methods involve graph colorings and labelings. A graph coloring that allows us to distinguish every two adjacent vertices in a given graph in some manner is said to be neighbor-distinguishing. On the other hand, a graph coloring is vertex-distinguishing if the coloring provides us with a way to distinguish every two vertices in a graph regardless of whether they are adjacent or not.
In this talk, some edge labelings that give rise to ways of distinguishing vertices are introduced. Let G be a connected graph of size at least 2 and c an edge labeling of G using k labels, say 1, 2, ... , k, where adjacent edges may be assigned the same label. For each vertex v of G, the code of v with respect to c is the k-vector whose i-th coordinate is the number of edges incident with v that are labeled i. The labeling c is called a detectable labeling of G if distinct vertices in G have distinct codes, that is, a detectable labeling of a graph is a vertex-distinguishing edge labeling of the graph. We discuss some recent results in this area of research and related topics.

開催年月日： 2012年10月

記述言語：英語   会議種別：口頭発表（一般）  

国名：アメリカ合衆国  

Every connected graph G contains a closed walk in which every vertex in G appears at least once. Such a walk is a (vertex) covering walk in G. In particular, a shortest such walk is called a Hamiltonian walk in G and its length is called the Hamiltonian number of G. These concepts were introduced by S. E. Goodman and S. T. Hedetniemi in 1973 and have been studied by many. In this talk, we discuss some recent results in this area and related topics.

対象： 中学生,　高校生,　教育関係者

種別：出前授業

対象： 中学生,　高校生,　教育関係者

種別：出前授業

対象： 中学生,　高校生,　教育関係者

種別：出前授業