All Outputs (93)

A generalised upper bound for the k-tuple domination number (2005)
Presentation / Conference Contribution

The domination parameters of cubic graphs (2005)
Journal Article

Let ir(G), γ(G), i(G), β0(G), Γ(G) and IR(G) be the irredundance number, the domination number, the independent domination number, the independence number, the upper domination number and the upper irredundance number of a graph G, respectively. In t... Read More about The domination parameters of cubic graphs.

Basic perfect graphs and their extensions (2005)
Presentation / Conference Contribution

In this article, we present a characterization of basic graphs in terms of forbidden induced subgraphs. This class of graphs was introduced by Conforti et al. (Square-free perfect graphs, J. Combin. Theory Ser. B, 90 (2) (2004) 257-307), and it plays... Read More about Basic perfect graphs and their extensions.

A characterisation of domination perfect graphs (2004)
Presentation / Conference Contribution

Graph-theoretic problems and the computer system GraphLab (2004)
Presentation / Conference Contribution

Basic graphs (2003)
Presentation / Conference Contribution

Locally well-dominated and locally independent well-dominated graphs (2003)
Journal Article

In this article we present characterizations of locally well-dominated graphs and locally independent well-dominated graphs, and a sufficient condition for a graph to be k-locally independent well-dominated. Using these results we show that the irred... Read More about Locally well-dominated and locally independent well-dominated graphs.

Bipartition of graphs into subgraphs with prescribed hereditary properties (2003)
Journal Article

On the differences of the independence, domination and irredundance parameters of a graph (2003)
Journal Article

Proof of a conjecture on irredundance perfect graphs (2002)
Journal Article

Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H) = γ(H), for every induced subgraph H of G. In this article we present a result which immediately imp... Read More about Proof of a conjecture on irredundance perfect graphs.

A disproof of Henning's conjecture on irredundance perfect graphs (2002)
Journal Article

Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H) = γ(H), for every induced subgraph H of G. In this paper, we disprove the known conjecture of Hennin... Read More about A disproof of Henning's conjecture on irredundance perfect graphs.

Perfect graphs of strong domination and independent strong domination (2001)
Journal Article

Let γ(G), i(G), γs(G) and is(G) denote the domination number, the independent domination number, the strong domination number and the independent strong domination number of a graph G, respectively. A graph G is called γi-perfect (domination perfect)... Read More about Perfect graphs of strong domination and independent strong domination.

An overview of author's results in graph theory (2000)
Presentation / Conference Contribution

Domination parameters of cubic graphs (2000)
Presentation / Conference Contribution

A semi-induced subgraph characterization of upper domination perfect graphs (1999)
Journal Article

Let β(G) and Γ(G) be the independence number and the upper domination number of a graph G, respectively. A graph G is called Γ-perfect if β(H) = Γ(H), for every induced subgraph H of G. The class of Γ-perfect graphs generalizes such well-known classe... Read More about A semi-induced subgraph characterization of upper domination perfect graphs.

Upper domination and upper irredundance perfect graphs (1998)
Journal Article

Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called Γ-perfect if β(H) = Γ(H), for every induced subgraph H of G. A graph G is called IR-perfect if Γ(H)... Read More about Upper domination and upper irredundance perfect graphs.

Line hypergraphs: A survey (1998)
Journal Article

The survey is devoted to line graphs and a new multivalued function L called the line hypergraph. This function generalizes two classical concepts at once, namely the line graph and the dual hypergraph. In a certain sense, line graphs and dual hyperg... Read More about Line hypergraphs: A survey.

The Ratio of the Irredundance Number and the Domination Number for Block-Cactus Graphs (1998)
Journal Article

Let γ(G) and ir(G) denote the domination number and the irredundance number of a graph G, respectively. Allan and Laskar [Proc. 9th Southeast Conf. on Combin., Graph Theory & Comp. (1978) 43-56] and Bollobás and Cockayne [J. Graph Theory (1979) 241-2... Read More about The Ratio of the Irredundance Number and the Domination Number for Block-Cactus Graphs.

Pi-tau-perfect graphs (1997)
Presentation / Conference Contribution

A semi-induced subgraph characterization of upper domination perfect graphs (1997)
Presentation / Conference Contribution