曲面上图的短圈结构与Mohar和Thomassen的一个问题的解决

研究了(赋权)图的圈基结构并且对包含在最小圈基中的短圈提供了大量信息. 建立了一个基变换的Hall型定理, 利用此定理, 给出了判断一个圈基是最小圈基的充分必要条件, 而且，证明了一个(赋权)图的最小圈基结构是唯一的. 这一性质对于最大圈基也成立 (尽管在最小圈基方面已有很多工作, 而在最大圈基方面的工作几乎没有). 利用这些方法， 发现了(赋权)图中具有特定性质的短圈的一些新结果. 作为应用， 决定了一个嵌入图的短圈的结构, 并找到一个多项式算法能够判断一个嵌入图中是否存在双侧圈, 如果这样的圈存在, 就可以找到一个最短的双侧圈. 这回答了B. Mohar和C. Thomassen提出的一个未解决问题, 并对他们提出的另一个未解决问题给出了部分解答.     

一个Lie代数的子代数及其相关的两类Loop代数

本文构造了Lie代数A2的一个子代数A2,通过选取恰当的基元阶数得到相应的一个loop代数A2,由此设计一个等谱问题,利用屠格式得到了一个新的Liouville可积的Hamilton方程族.作为其约化情形,得到了一个非线性有理分式型演化方程.再由一个矩阵变换,得到了换位运算与A2等价的Lie代数A1的一个子代数A1,将A1再扩展成一个新的高维loop代数G,利用G获得了所得方程族的一类扩展可积系统.     

一类二阶泛函微分方程的周期边值问题

讨论了一类二阶泛函微分方程的周期边值问题,给出了上、下解的一个新的概念,并且得到了一个新的比较结果.同时,修正了相关文献中的一个错误.     

Gdk图的平面性和平面图的色数

利用欧拉公式研究了Gdk图的平面性,获得了一个重要定理,并由此得到了关于平面图色数的一个结论.     

截断切割问题的参数规划模型

对一个截断切割问题,本文给出了一个参数网络规划模型,总结了[3]中的解法,并给出了一个实例.     

关于凸体的Lp-曲率映象的不等式

Lutwak提出了凸体的Lp-曲率映象的概念,并证明了凸体与其Lp-曲率映象的体积之间的一个不等式.本文给出了Lutwak结果的一个一般形式,继而证明了凸体与其Lp-曲率映象的极的体积之间的一个不等式,并得到了凸体的Lp-投影体和Lp-曲率映象的体积之间的一个不等式.     

关于凸体的Lp-曲率映象的不等式

Lutwak提出了凸体的Lp-曲率映象的概念,并证明了凸体与其Lp-曲率映象的体积之间的一个不等式．本文给出了Lutwak结果的一个一般形式,继而证明了凸体与其Lp-曲率映象的极的体积之间的一个不等式,并得到了凸体的Lp-投影体和Lp-曲率映象的体积之间的一个不等式．     

关于多项式映射自同构恒等集的一个注记

本文给出了判定一个仿射代数集是否是一个自同构恒等集的充分条件.作为一个推论,我们给出了Mckay-Wang的一个问题的一个新证明.我们也给出了一些具体的例子来说明主要的定理.     

“意外”的发生，意外的收获

我在上高中数学选修2—3《离散型随机变量的方差和标准差》这节课时,一节课快结束了,在做练习时发生了一个小插曲,在大部分学生做出了一个一般性答案的同时,出现了“不同”的声音,有一个同学得到的结果和其他同学不一样但却非常接近,这是怎么回事呢？他错了吗？     

求极大T-传递内部的新方法

利用Fodor等的基本思想,从另一个角度构造了一个有限论域上模糊关系的极大T-传递内部,求得另一个与Fodor等的方法不同的极大T-传递内部,并在计算机上加以实现,从而为将一个非传递的模糊关系改造为传递的模糊关系提供了一个新的方法.     

Cover-incomparability graphs and chordal graphs

The problem of recognizing cover-incomparability graphs (i.e. the graphs obtained from posets as the edge-union of their covering and incomparability graph) was shown to be NP-complete in general [J. Maxová, P. Pavlíkova, A. Turzík, On the complexity of cover-incomparability graphs of posets, Order 26 (2009) 229-236], while it is for instance clearly polynomial within trees. In this paper we concentrate on (classes of) chordal graphs, and show that any cover-incomparability graph that is a chordal graph is an interval graph. We characterize the posets whose cover-incomparability graph is a block graph, and a split graph, respectively, and also characterize the cover-incomparability graphs among block and split graphs, respectively. The latter characterizations yield linear time algorithms for the recognition of block and split graphs, respectively, that are cover-incomparability graphs.     

探针区间图和STS-探针区间图的刻划

该文首先引入了探针区间序来刻划探针区间图;接着给出STS-探针区间图的探针区间完备的一种构造方法,并借此得到二部图G是相对于给定顶点划分的STS-探针区间图的一个充要条件;同时也说明了STS-探针区间图其实就是其他文献中被独立研究的凸二部图.最后基于前面给出的STS-探针区间图的刻划结果提供了两种简单的O(V E)时间的STS-探针区间图的判别算法.     

Equistable graphs, general partition graphs, triangle graphs, and graph products

In this paper we examine the connections between equistable graphs, general partition graphs and triangle graphs. While every general partition graph is equistable and every equistable graph is a triangle graph, not every triangle graph is equistable, and a conjecture due to Jim Orlin states that every equistable graph is a general partition graph. The conjecture holds within the class of chordal graphs; if true in general, it would provide a combinatorial characterization of equistable graphs.Exploiting the combinatorial features of triangle graphs and general partition graphs, we verify Orlin’s conjecture for several graph classes, including AT-free graphs and various product graphs. More specifically, we obtain a complete characterization of the equistable graphs that are non-prime with respect to the Cartesian or the tensor product, and provide some necessary and sufficient conditions for the equistability of strong, lexicographic and deleted lexicographic products. We also show that the general partition graphs are not closed under the strong product, answering a question by McAvaney et al.     

Balanced Cayley graphs and balanced planar graphs

A balanced graph is a bipartite graph with no induced circuit of length . These graphs arise in integer linear programming. We focus on graph-algebraic properties of balanced graphs to prove a complete classification of balanced Cayley graphs on abelian groups. Moreover, in this paper, we prove that there is no cubic balanced planar graph. Finally, some remarkable conjectures for balanced regular graphs are also presented. The graphs in this paper are simple.     

Characterization of digraphs with equal domination graphs and underlying graphs

A domination graph of a digraph D, dom(D), is created using the vertex set of D and edge {u,v}∈E[dom(D)] whenever (u,z)∈A(D) or (v,z)∈A(D) for every other vertex z∈V(D). The underlying graph of a digraph D, UG(D), is the graph for which D is a biorientation. We completely characterize digraphs whose underlying graphs are identical to their domination graphs, UG(D)=dom(D). The maximum and minimum number of single arcs in these digraphs, and their characteristics, is given.     

Mock threshold graphs

Mock threshold graphs are a simple generalization of threshold graphs that, like threshold graphs, are perfect graphs. Our main theorem is a characterization of mock threshold graphs by forbidden induced subgraphs. Other theorems characterize mock threshold graphs that are claw-free and that are line graphs. We also discuss relations with chordality and well-quasi-ordering as well as algorithmic aspects.     

Entire choosability of near-outerplane graphs

It is proved that if G is a plane embedding of a K₄-minor-free graph with maximum degree Δ, then G is entirely 7-choosable if Δ≤4 and G is entirely (Δ+2)-choosable if Δ≥5; that is, if every vertex, edge and face of G is given a list of max{7,Δ+2} colours, then every element can be given a colour from its list such that no two adjacent or incident elements are given the same colour. It is proved also that this result holds if G is a plane embedding of a K_2,3-minor-free graph or a -minor-free graph. As a special case this proves that the Entire Coluring Conjecture, that a plane graph is entirely (Δ+4)-colourable, holds if G is a plane embedding of a K₄-minor-free graph, a K_2,3-minor-free graph or a -minor-free graph.