Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable

Wang and Lih (2002) conjectured that every planar graph without adjacent triangles is 4-choosable. In this paper, we prove that every planar graph without any 4-cycle adjacent to two triangles is DP-4-colorable, which improves the results of Lam et al. (1999), Cheng et al. (2016) and Kim and Yu [ arXiv:1709.09809v1].     

Strong edge-coloring for planar graphs with large girth

A strong edge-coloring of a graph $G=(V,E)$ is a partition of its edge set $E$ into induced matchings. Let $G$ be a connected planar graph with girth $k\ge 26$ and maximum degree $\Delta$. We show that either $G$ is isomorphic to a subgraph of a very special $\Delta$-regular graph with girth $k$, or $G$ has a strong edge-coloring using at most $2\Delta +\lceil \frac{12(\Delta -2)}{k}\rceil$ colors.     

积层板的制造方法

概述了积层板的开发背景、制造工艺和最近的开发动向。     

A Multilayer Optical Packet Switching Network Based on the Kautz Graph and Optical Passive Star Couplers

The multihop optical network is the most appropriate solution to satisfy the increasing applications of Internet services. This paper extends the regular Kautz graph to one with multiple layers in order to produce more architectural variations. The connectivity between adjacent layers utilizes the systematic connection patterns of a regular Kautz graph. A routing algorithm based on its property is presented. Optical passive star (OPS) couplers are adopted to implement our new topologies. Three scheduling criteria that can solve the contention problem in the intermediate nodes are evaluated and compared in terms of their capability to improve the accessibility.     

BaxSr（1—x）TiO3多层膜椭偏光谱研究

用溶胶－凝胶技术在Bi(100）衬底上制备了单层和渐变型多层的BaxSr(1-X)TiO3薄膜，其膜层组分分别为：Ba0.7Sr0.3TiO3,Ba0.8Sr0.2TiO,Ba0.9Sr0.1TiO3,BaTiO3，对生长制备出的多层BaxSr(1-X)TiO3薄膜进行了变角度椭偏光谱测量，通过椭偏光谱解谱分析研究，首次得到了BaxSr(1-X)TiO3多层膜结构不同膜层的膜厚和光学常数，其结果显示：椭偏光谱分析得到的不同膜层的膜厚与卢瑟福背向散射测量得到的结果基本相符；渐变型多层膜中BaTiO3薄膜的折射率比单层BaTiO3薄膜折射率大许多，与体BaTiO3的折射率相接近，这说明渐变型多层膜中BaTiO3薄膜的光学性质与体材料的光学性质接近。     

Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups

We examine two criteria for balance of a gain graph, one based on binary cycles and one on circles. The graphs for which each criterion is valid depend on the set of allowed gain groups. The binary cycle test is invalid, except for forests, if any possible gain group has an element of odd order. Assuming all groups are allowed, or all abelian groups, or merely the cyclic group of order 3, we characterize, both constructively and by forbidden minors, the graphs for which the circle test is valid. It turns out that these three classes of groups have the same set of forbidden minors. The exact reason for the importance of the ternary cyclic group is not clear. © 2005 Wiley Periodicals, Inc. J Graph Theory     

网络展开图与符号网络分析

采用封闭网络模型,按照电路元件参数,采用开路、短路和着色运算,将电路图逐层分解,得到网络展开图.给出网络展开图的概念和运算规则,指出网络展开图中从根到末稍每个路径的值就是网络行列式展开式中的一个有效项,从而由网络展开图得到符号网络函数.该方法直接对电路图进行运算,不需要建立任何形式的电路方程和行列式,适用于一般的有源电路,而且能生成各种类型的网络函数.     

用Java实现网上结构图实验仿真

基于线性系统仿真的连接矩阵方法，用Java语言开发面向结构图的实验仿真程序，以Applet小应用程序的形式插入网页中运行，实现了信号与系统网上实验教学中的结构图实验仿真。经试用，程序在浏览器中运行正常，可以完成一般线性系统仿真，与以MATLAB，LABView等程序开发的实验仿真程序相比，该程序运行环境简单，几乎所有常用的Web浏览器都支持Java运行，不需另行安装相应组件。对于线性系统结构图，实现了所见即所得的图形化编程环境，具有较好的人机交互性。