Presentation	2007-01-30 Improvement of track layout of bipartite graph subdivisions Miki MIYAUCHI,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	This paper studies the problem of track layout of bipartite graph subdivisions. Recently Dujmovic and Wood showed that every graph G has a (d+1,2)-track subdivision with [numerical formula] division vertices per edge. The author improved this result for the case of bipartite graphs G_(m≥n) with m and n partite sets, and showed that for every integer d≥2, every bipartite graph G_ (m≥n) has a (d+1,2)-track subdivision with [numerical formula] division vertices per edge. This paper improves the proof of this theorem.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	graph drawing / bipartite graph / subdivision / track / track layout of graphs
Paper #	CAS2006-71
Date of Issue

Conference Information
Committee	CAS
Conference Date	2007/1/23(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	Circuits and Systems (CAS)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Improvement of track layout of bipartite graph subdivisions
Sub Title (in English)
Keyword(1)	graph drawing
Keyword(2)	bipartite graph
Keyword(3)	subdivision
Keyword(4)	track
Keyword(5)	track layout of graphs
1st Author's Name	Miki MIYAUCHI
1st Author's Affiliation	NTT Communication Science Laboratories, NTT Corporation()
Date	2007-01-30
Paper #	CAS2006-71
Volume (vol)	vol.106
Number (no)	512
Page	pp.pp.-
#Pages	6
Date of Issue