✦ LIBER ✦

Some results on odd factors of graphs

✍ Scribed by Cui Yuting; Mikio Kano

Publisher: John Wiley and Sons
Year: 1988
Tongue: English
Weight: 245 KB
Volume: 12
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190120305

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some new results on 1-rotational 2-facto

Some new results on 1-rotational 2-factorizations of the complete graph

✍ Tommaso Traetta 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

## Abstract It is known that a necessary condition for the existence of a 1‐rotational 2‐factorization of the complete graph __K__~2__n__+1~ under the action of a group __G__ of order 2__n__ is that the involutions of __G__ are pairwise conjugate. Is this condition also sufficient? The complete ans

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

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 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

Clique-coloring some classes of odd-hole

Clique-coloring some classes of odd-hole-free graphs

✍ David Défossez 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB 👁 1 views

On Finite s-Transitive Graphs of Odd Ord

On Finite s-Transitive Graphs of Odd Order

✍ Cai Heng Li 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 128 KB

It is shown that, for a positive integer s, there exists an s-transitive graph of odd order if and only if s 3 and that, for s=2 or 3, an s-transitive graph of odd order is a normal cover of a graph for which there is an automorphism group that is almost simple and s-transitive.