Presentation 2000/4/26
Some fundamental properties of unit and proper grid intersection graphs
Masanori Wada, Mitsunori Togasaki, Koichi Yamazaki,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we define unit grid intersection graphs and prpoer grid intersection graphs, then we show that unit grid intersection graphs are exactly the prpoer grid intersection graphs. We also demonstrate that there is a graph which is grid intersection graph but not unit grid intersection graph and any bipartite permutation graph is a unit grid intersection graph.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) grid intersection graph / unit / prpoer grid intersection graph
Paper # COMP2000-1
Date of Issue

Conference Information
Committee COMP
Conference Date 2000/4/26(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Some fundamental properties of unit and proper grid intersection graphs
Sub Title (in English)
Keyword(1) grid intersection graph
Keyword(2) unit
Keyword(3) prpoer grid intersection graph
1st Author's Name Masanori Wada
1st Author's Affiliation Department of Computer Science Gunma University()
2nd Author's Name Mitsunori Togasaki
2nd Author's Affiliation Department of Computer Science Gunma University
3rd Author's Name Koichi Yamazaki
3rd Author's Affiliation Department of Computer Science Gunma University
Date 2000/4/26
Paper # COMP2000-1
Volume (vol) vol.100
Number (no) 25
Page pp.pp.-
#Pages 7
Date of Issue