A note on Hadwiger’s conjecture for W5-free graphs with independence number two

The Hadwiger number of a graph $G$, denoted $h\left(G\right)$, is the largest integer $t$ such that $G$ contains $K_t$ as a minor. A famous conjecture due to Hadwiger in 1943 states that for every graph $G$, $h\left(G\right)\ge \chi \left(G\right)$, where $\chi \left(G\right)$ denotes the chromatic number of $G$. Let $\alpha \left(G\right)$ denote the independence number of $G$. A graph is $H$-free if it does not contain the graph $H$ as an induced subgraph. In 2003, Plummer, Stiebitz and Toft proved that $h\left(G\right)\ge \chi \left(G\right)$ for all $H$-free graphs $G$ with $\alpha \left(G\right)\le 2$, where $H$ is any graph on four vertices with $\alpha \left(H\right)\le 2$, $H=C_5$, or $H$ is a particular graph on seven vertices. In 2010, Kriesell subsequently generalized the statement to include all forbidden subgraphs $H$ on five vertices with $\alpha \left(H\right)\le 2$. In this note, we prove that $h\left(G\right)\ge \chi \left(G\right)$ for all $W_5$-free graphs $G$ with $\alpha \left(G\right)\le 2$, where $W_5$ denotes the wheel on six vertices.     

Proof of a conjecture on irredundance perfect graphs

Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H)=γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 292–306, 2002     

4一致反超图的最小边数问题

混合超图是在超图的基础上添加一个反超边得到的图．超边和反超边的区别主要体现在着色要求上．在着色中,要求每一超边至少要有两个点着不同的颜色,而每一反超边至少有两个点着相同的颜色．最大最小颜色数分别称为混合超图的上色数和下色数。本文主要研究反超图,即只含反超边的超图。讨论了上色数为3的4一致超图的最小边数问题．给出了上色数为3的4一致反超图的最小边数的一个上界和一个下界．     

Interference of probabilities and number field structure of quantum models

We study the probabilistic consequences of the choice of the basic number field in the quantum formalism. We demonstrate that by choosing a number field for a linear space representation of quantum model it is possible to describe various interference phenomena. We analyse interference of probabilistic alternatives induced by real, complex, hyperbolic (Clifford) and p‐adic representations.     

推广的奇轮的圆色数

图G的圆色数(又称"星色数")xc(G)是Vince在1988年提出的,它是图的色数 的自然推广.本文由奇轮出发构造了一族平面图,并证明了此类图的圆色数恰恰介于2和 3之间,填补了该领域的空白.     

Fiberings with Fiber RP（κ）

Let κ be non-negative integer. The unoriented bordism classes, which can be represented as [RP（ξ^κ）] where ξ^κ is a k-plane bundle, form an ideal of the unoriented bordism ring MO.. A group of generators of this ideal expressed by a base of MO. and a necessary and sufficient condition for a bordism class to belong to this ideal are given.     

Circular perfect graphs

For 1 ≤ d ≤ k, let K_k/d be the graph with vertices 0, 1, …, k ? 1, in which i ～j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χ_c(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to K_k/d. The circular clique number ω_c(G) of G is the maximum of those k/d for which K_k/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χ_c(H) = ω_c(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, N_G[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, N_G[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P₅ (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph K_k/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005     

Assessment of two‐equation turbulence modelling for high Reynolds number hydrofoil flows

This paper presents an evaluation of the capability of turbulence models available in the commercial CFD code FLUENT 6.0 for their application to hydrofoil turbulent boundary layer separation flow at high Reynolds numbers. Four widely applied two‐equation RANS turbulence models were assessed through comparison with experimental data at Reynolds numbers of 8.284×106 and 1.657×107. They were the standard k–εmodel, the realizable k–εmodel, the standard k–ωmodel and the shear‐stress‐transport (SST) k–ωmodel. It has found that the realizable k–εturbulence model used with enhanced wall functions and near‐wall modelling techniques, consistently provides superior performance in predicting the flow characteristics around the hydrofoil. Copyright © 2004 John Wiley & Sons, Ltd.     

A high‐resolution scheme for low Mach number flows

A method for computing low Mach number flows using high‐resolution interpolation and difference formulas, within the framework of the Marker and Cell (MAC) scheme, is presented. This increases the range of wavenumbers that are properly resolved on a given grid so that a sufficiently accurate solution can be obtained without extensive grid refinement. Results using this scheme are presented for three problems. The first is the two‐dimensional Taylor–Green flow which has a closed form solution. The second is the evolution of perturbations to constant‐density, plane channel flow for which linear stability solutions are known. The third is the oscillatory instability of a variable density plane jet. In this case, unless the sharp density gradients are resolved, the calculations would breakdown. Under‐resolved calculations gave solutions containing vortices which grew in place rather than being convected out. With the present scheme, regular oscillations of this instability were obtained and vortices were convected out regularly. Stable computations were possible over a wider range of sensitive parameters such as density ratio and co‐flow velocity ratio. Copyright © 2004 John Wiley Sons, Ltd.