目前,一般个人电脑的大容量存储设备普遍采用 IDE 接口,接线为40芯排线,为区别第1线和第40线,第1线颜色与其他线不同,多为红线或花线。主板上有 Primary(初始)和 Secondary(辅助)两个 IDE 接口,每个 IDE 口有两个 IDE 设备,分别为 Mast...目前,一般个人电脑的大容量存储设备普遍采用 IDE 接口,接线为40芯排线,为区别第1线和第40线,第1线颜色与其他线不同,多为红线或花线。主板上有 Primary(初始)和 Secondary(辅助)两个 IDE 接口,每个 IDE 口有两个 IDE 设备,分别为 Master(主设备)、Slave(从属设备),总共可以接4个 IDE 设备。常见 IDE 设备有硬盘和 CD-ROM等,有的其他设备也采用 IDE 接口,如 ZIP、JAZZ、CDFI 等。Primary 初始接口的地址是01F0～01F7,IRQ 为14:其辅助接口 Secondary 的地址是0170～0177.IRQ 为15。硬盘一般为主设备.接 Primary展开更多
A k-colouring （not necessarily proper） of vertices of a graph is called acyclic, if for every pair of distinct colours i and j the subgraph induced by the edges whose endpoints have colours i and j is acyclic. We co...A k-colouring （not necessarily proper） of vertices of a graph is called acyclic, if for every pair of distinct colours i and j the subgraph induced by the edges whose endpoints have colours i and j is acyclic. We consider acyclie k-eolourings such that each colour class induces a graph with a given （hereditary） property. In particular, we consider aeyclic k-eolourings in which each colour class induces a graph with maximum degree at most t, which are referred to as acyclic t-improper k-colourings. The acyelic t-improper chromatic number of a graph G is the smallest k for which there exists an acyclic t-improper k-colouring of G. We focus on acyclic colourings of graphs with maximum degree 4. We prove that 3 is an upper bound for the acyclic 3-improper chromatic number of this class of graphs. We also provide a non-trivial family of graphs with maximum degree 4 whose acyclic 3-improper chromatic number is at most 2, namely, the graphs with maximum average degree at most 3. Finally, we prove that any graph G with A（G） ≤ 4 can be acyelically coloured with 4 colours in such a way that each colour class induces an acyclic graph with maximum degree at most 3.展开更多
文摘目前,一般个人电脑的大容量存储设备普遍采用 IDE 接口,接线为40芯排线,为区别第1线和第40线,第1线颜色与其他线不同,多为红线或花线。主板上有 Primary(初始)和 Secondary(辅助)两个 IDE 接口,每个 IDE 口有两个 IDE 设备,分别为 Master(主设备)、Slave(从属设备),总共可以接4个 IDE 设备。常见 IDE 设备有硬盘和 CD-ROM等,有的其他设备也采用 IDE 接口,如 ZIP、JAZZ、CDFI 等。Primary 初始接口的地址是01F0～01F7,IRQ 为14:其辅助接口 Secondary 的地址是0170～0177.IRQ 为15。硬盘一般为主设备.接 Primary
基金supported by the Minister of Science and Higher Education of Poland(Grant No.JP2010009070)
文摘A k-colouring （not necessarily proper） of vertices of a graph is called acyclic, if for every pair of distinct colours i and j the subgraph induced by the edges whose endpoints have colours i and j is acyclic. We consider acyclie k-eolourings such that each colour class induces a graph with a given （hereditary） property. In particular, we consider aeyclic k-eolourings in which each colour class induces a graph with maximum degree at most t, which are referred to as acyclic t-improper k-colourings. The acyelic t-improper chromatic number of a graph G is the smallest k for which there exists an acyclic t-improper k-colouring of G. We focus on acyclic colourings of graphs with maximum degree 4. We prove that 3 is an upper bound for the acyclic 3-improper chromatic number of this class of graphs. We also provide a non-trivial family of graphs with maximum degree 4 whose acyclic 3-improper chromatic number is at most 2, namely, the graphs with maximum average degree at most 3. Finally, we prove that any graph G with A（G） ≤ 4 can be acyelically coloured with 4 colours in such a way that each colour class induces an acyclic graph with maximum degree at most 3.
