✦ LIBER ✦

Tighter Bounds on the Size of a MaximumP3-Matching in a Cubic Graph

✍ Scribed by Adrian Kosowski; Michał Małafiejski; Paweł Żyliński

Publisher: Springer Japan
Year: 2008
Tongue: English
Weight: 265 KB
Volume: 24
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-008-0807-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tight Lower Bounds on the Size of a Maxi

Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph

✍ Michael A. Henning; Anders Yeo 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 106 KB

Bounds on the lower size of A 7-critical

Bounds on the lower size of A 7-critical graph

✍ Huanping Liu; Zhongfu Zhang; Dean Shen 📂 Article 📅 1994 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 307 KB

Forbidden subgraphs and bounds on the si

Forbidden subgraphs and bounds on the size of a maximum matching

✍ Michael D. Plummer; Akira Saito 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

## Abstract Let __K__~1,__n__~ denote the star on __n__ + 1 vertices; that is, __K__~1,__n__~ is the complete bipartite graph having one vertex in the first vertex class of its bipartition and __n__ in the second. The special graph __K__~1,3~, called the __claw__, has received much attention in the

A new bound on the feedback vertex sets

A new bound on the feedback vertex sets in cubic graphs

✍ Jiping Liu; Cheng Zhao 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 461 KB

In this paper a new upper bound for the feedback set of cubic graphs is obtained. This result answers a question posed by Speckenmeyer (1986, 1988) in the field of feedback vertex set and improves several former results due to Bondy et al. (1987). Also this new bound is sharp in some cases.

An upper bound on the size of a largest

An upper bound on the size of a largest clique in a graph

✍ Dennis P. Geoffroy; David P. Sumner 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 308 KB 👁 1 views

## Abstract A graph is point determining if distinct vertices have distinct neighborhoods. The nucleus of a point‐determining graph is the set __G__^O^ of all vertices, __v__, such that __G__–__v__ is point determining. In this paper we show that the size, ω(__G__), of a maximum clique in __G__ sat

On bounds for size Ramsey numbers of a c

On bounds for size Ramsey numbers of a complete tripartite graph

✍ Izolda Gorgol 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 146 KB

It will be shown that the (diagonal) size Ramsey number of K ..... is bounded below by c. 64n , 2 3oj2 ~n 2 and above by 2 Let F and G be graphs. The symbol F >---,G denotes that in any two-colouring (say red and blue) of edges of F a monochromatic copy of G is contained. The Ramsey number r(G) is t