A (k,2)-track layout of a graph G consists of a 2-track assignment of G and an edge k-coloring of G with no monochromatic X-crossing. This paper studies the problem of (k,2)-track layout of bipartite graph subdivisions. Recently V. Dujmovi
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Miki MIYAUCHI, "(d+1,2)-Track Layout of Bipartite Graph Subdivisions" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 9, pp. 2292-2295, September 2008, doi: 10.1093/ietfec/e91-a.9.2292.
Abstract: A (k,2)-track layout of a graph G consists of a 2-track assignment of G and an edge k-coloring of G with no monochromatic X-crossing. This paper studies the problem of (k,2)-track layout of bipartite graph subdivisions. Recently V. Dujmovi
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.9.2292/_p
Copy
@ARTICLE{e91-a_9_2292,
author={Miki MIYAUCHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={(d+1,2)-Track Layout of Bipartite Graph Subdivisions},
year={2008},
volume={E91-A},
number={9},
pages={2292-2295},
abstract={A (k,2)-track layout of a graph G consists of a 2-track assignment of G and an edge k-coloring of G with no monochromatic X-crossing. This paper studies the problem of (k,2)-track layout of bipartite graph subdivisions. Recently V. Dujmovi
keywords={},
doi={10.1093/ietfec/e91-a.9.2292},
ISSN={1745-1337},
month={September},}
Copy
TY - JOUR
TI - (d+1,2)-Track Layout of Bipartite Graph Subdivisions
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2292
EP - 2295
AU - Miki MIYAUCHI
PY - 2008
DO - 10.1093/ietfec/e91-a.9.2292
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2008
AB - A (k,2)-track layout of a graph G consists of a 2-track assignment of G and an edge k-coloring of G with no monochromatic X-crossing. This paper studies the problem of (k,2)-track layout of bipartite graph subdivisions. Recently V. Dujmovi
ER -