✦ LIBER ✦

Disjoint Triangles of a Cubic Line Graph

✍ Scribed by Xiao-Dong Zhang; Stanislaw Bylka

Publisher: Springer Japan
Year: 2004
Tongue: English
Weight: 262 KB
Volume: 20
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-004-0551-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extremal bipartite subgraphs of cubic tr

Extremal bipartite subgraphs of cubic triangle-free graphs

✍ Glenn Hopkins; William Staton 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 275 KB

## Abstract A cubic triangle‐free graph has a bipartite subgraph with at least 4/5 of the original edges. Examples show that this is a best possible result.

On the maximum induced forests of a conn

On the maximum induced forests of a connected cubic graph without triangles

✍ Maolin Zheng; Xiaoyun Lu 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 438 KB

Let t(G) denote the cardinality of a maximum induced forest of a graph G with n vertices. For connected simple cubic graphs G without triangles, it is shown that r(G) 3 2n/3 except for two particular graphs. This lower bound is sharp and it improves a result due to J.A. Bondy, et al. [l]. Using this

How many disjoint 2-edge paths must a cu

How many disjoint 2-edge paths must a cubic graph have?

✍ Alexander Kelmans; Dhruv Mubayi 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 234 KB

## Abstract In this paper we show that every simple cubic graph on __n__ vertices has a set of at least ⌈ __n__/4 ⌉ disjoint 2‐edge paths and that this bound is sharp. Our proof provides a polynomial time algorithm for finding such a set in a simple cubic graph. © 2003 Wiley Periodicals, Inc. J Gra

On the Number of Acute Triangles in a St

On the Number of Acute Triangles in a Straight-Line Embedding of a Maximal Planar Graph

✍ Atsushi Kaneko; Hiroshi Maehara; Mamoru Watanabe 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 80 KB

In this paper we show that any maximal planar graph with m triangles except the unbounded face can be transformed into a straight-line embedding in which at least WmÂ3X triangles are acute triangles. Moreover, we show that any maximal outerplanar graph can be transformed into a straight-line embeddi

A conjecture on triangles of graphs

✍ Zsolt Tuza 📂 Article 📅 1990 🏛 Springer Japan 🌐 English ⚖ 563 KB

Properties of a planar cubic graph

✍ Shunichi Toida 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 506 KB

It is shown that a planar can always be to planar graph fewer vertices. It is shown if a planar cubic graph is edge-3colorable then the reduction of the number of its vertices is possible without changing colors of its edges.