𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some results about f-critical graphs

✍ Scribed by Guizhen Liu; Jianfeng Hou; Jiansheng Cai

Publisher
John Wiley and Sons
Year
2007
Tongue
English
Weight
171 KB
Volume
50
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some remarks about factors of graphs
Some remarks about factors of graphs
✍ José R. Correa; Martín Matamala 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 148 KB

## Abstract A (__g__, __f__)‐factor of a graph is a subset __F__ of __E__ such that for all $v \in V$, $g(v)\le {\rm deg}\_{F}(v)\le f(v)$. Lovasz gave a necessary and sufficient condition for the existence of a (__g__, __f__)‐factor. We extend, to the case of edge‐weighted graphs, a result of Kano

Some results on graphs without long indu
Some results on graphs without long induced paths
✍ Dong, Jinquan 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB 👁 2 views

Let I(t) be the set of integers with the property that in every Pt-free connected graph G, the i-center C,(G) induces a connected subgraph. What is the minimum element of /(t)? In this paper, we prove that this minimum is [2t/3] -1 if t = 0 or Z(mod3) and is [ 2 t / 3 ] otherwise. Furthermore, as co

Some 3-connected 4-edge-critical non-Ham
Some 3-connected 4-edge-critical non-Hamiltonian graphs
✍ Yang Yuansheng; Zhao Chengye; Lin Xiaohui; Jiang Yongsong; Hao Xin 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 79 KB 👁 1 views

## Abstract Let γ(__G__) be the domination number of graph __G__, thus a graph __G__ is __k__‐edge‐critical if γ (__G__) = k, and for every nonadjacent pair of vertices __u__ and υ, γ(__G__ + __u__υ) = k−1. In Chapter 16 of the book “Domination in Graphs—Advanced Topics,” D. Sumner cites a conjectu

Some Results About the Quillen Complex o
Some Results About the Quillen Complex ofSp2n(q)
✍ Kaustuv Mukul Das 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 284 KB

The structure of the Quillen complex of Sp q at p, denoted A A Sp q , is 2 n p2 n known when p is the characteristic prime. In this paper it is shown that if It is also shown that the order complex of proper, nondegenerate subspaces of a 2 n-dimensional symplectic space over ‫ކ‬ ᎏordered by inclusi

Extensions of some factorization results
Extensions of some factorization results from simple graphs to multigraphs
✍ El-Zanati, S. I.; Plantholt, M. J.; Tipnis, S. K. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 71 KB

It was shown in a recent paper that an rs-regular multigraph G with maximum multiplicity µ(G) ≤ r can be factored into r regular simple graphs if first we allow the deletion of a relatively small number of hamilton cycles from G. In this paper, we use this theorem to obtain extensions of some factor