Presentation 1999/9/6
A 2-packing of three 3-based graphs in a 3-connected graph
Hiroshi Nagamochi, Katsuhiro Seki, Toshihide Ibaraki,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English)
Keyword(in Japanese) (See Japanese page)
Keyword(in English) graph / 3-connected / subgraph / packing / algorithm.
Paper # COMP99-35
Date of Issue

Conference Information
Committee COMP
Conference Date 1999/9/6(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) A 2-packing of three 3-based graphs in a 3-connected graph
Sub Title (in English)
Keyword(1) graph
Keyword(2) 3-connected
Keyword(3) subgraph
Keyword(4) packing
Keyword(5) algorithm.
1st Author's Name Hiroshi Nagamochi
1st Author's Affiliation Department of Applied Mathematics and Physics Graduate School of Infomatics Kyoto University()
2nd Author's Name Katsuhiro Seki
2nd Author's Affiliation Department of Applied Mathematics and Physics Graduate School of Infomatics Kyoto University
3rd Author's Name Toshihide Ibaraki
3rd Author's Affiliation Department of Applied Mathematics and Physics Graduate School of Infomatics Kyoto University
Date 1999/9/6
Paper # COMP99-35
Volume (vol) vol.99
Number (no) 288
Page pp.pp.-
#Pages 8
Date of Issue