#### Filter Results:

#### Publication Year

2007

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

The dissociation number of a graph G is the number of vertices in a maximum size induced subgraph of G with vertex degree at most 1. A k-path vertex cover of a graph G is a subset S of vertices of G such that every path of order k in G contains at least one vertex from S. The minimum 3-path vertex cover is a dual problem to the dissociation number. For this… (More)

A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψ k (G) the minimum cardinality of a k-path vertex cover in G. It is shown that the problem of determining ψ k (G) is NP-hard for each k ≥ 2, while for trees the problem can be solved in linear time. We investigate… (More)

We show that every (sub)cubic n-vertex graph with sufficiently large girth has fractional chromatic number at most 2.2978 which implies that it contains an independent set of size at least 0.4352n. Our bound on the independence number is valid to random cubic graphs as well as it improves existing lower bounds on the maximum cut in cubic graphs with large… (More)

- FULLERENE GRAPHS, Frantǐsek Kardoš, Riste Škrekovski
- 2007

In this paper, we study cyclic edge-cuts in fullerene graphs. First, we show that the cyclic edge-cuts of a fullerene graph can be constructed from its trivial cyclic 5-and 6-edge-cuts using three basic operations. This result immediatelly implies the fact that fullerene graphs are cyclically 5-edge-connected. Next, we characterize a class of nanotubes as… (More)

We show that for every cubic graph G with sufficiently large girth there exists a probability distribution on edge-cuts of G such that each edge is in a randomly chosen cut with probability at least 0.88672. This implies that G contains an edge-cut of size at least 1.33008n, where n is the number of vertices of G, and has fractional cut covering number at… (More)

A fullerene graph is a planar cubic 3-connected graph with only pentagonal and hexagonal faces. We show that fullerene graphs have exponentially many perfect matchings.

Lovász and Plummer conjectured in the 1970's that cubic bridge-less graphs have exponentially many perfect matchings. This conjecture has been verified for bipartite graphs by Voorhoeve in 1979, and for planar graphs by Chudnovsky and Seymour in 2008, but in general only linear bounds are known. In this paper, we provide the first superlinear bound in the… (More)

A fullerene graph is a planar cubic graph whose all faces are pentagonal and hexagonal. The structure of cyclic edge-cuts of fullerene graphs of sizes at most 6 is known. In the paper we study cyclic 7-edge connectivity of fullerene graphs, distinguishing between degenerated and non-degenerated cyclic edge-cuts, regarding the arrangement of the 12… (More)