Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Back to Simple Search

Advanced Search

Match of the following rules

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Currently displaying 1 – 17 of 17

Order by Relevance | Title | Year of publication

A note on the independence number of an identically self-dual perfect matroid design.

Marcu, Dănuţ — 1986

Publications de l'Institut Mathématique. Nouvelle Série

Note on the factors of graphs.

Marcu, Dǎnuţ — 2005

Novi Sad Journal of Mathematics

Another Upper Bound For The Domination Number Of A Graph.

Danut Marcu — 1986

Revista colombiana de matematicas

The middle graph of a hypergraph

Danut Marcu — 1990

Revista colombiana de matematicas

An upper bound on the domination number of a graph.

Dánut Marcu — 1986

Mathematica Scandinavica

Note on the regular digraphs

Dănuţ Marcu — 1985

Rendiconti del Seminario Matematico della Università di Padova

Note on the gammoids arising from undirected graphs

Dănuţ Marcu — 1990

Rendiconti del Seminario Matematico della Università di Padova

A note on the projective representations of finite groups

Dănuţ Marcu — 1999

Rendiconti del Seminario Matematico della Università di Padova

Note on $k$ -chromatic graphs

Dănuţ Marcu — 1994

Mathematica Bohemica

In this paper we characterize $k$ -chromatic graphs without isolated vertices and connected $k$ -chromatic graphs having a minimal number of edges.

Note on graphs colouring

Dănuţ Marcu — 1992

Mathematica Bohemica

In this paper, we show that the maximal number of minimal colourings of a graph with $n$ vertices and the chromatic number $k$ is equal to $k^{n - k}$ , and the single graph for which this bound is attained consists of a $k$ -clique and $n - k$ isolated vertices.

Note on Turán's graph

Dănuţ Marcu — 1993

Czechoslovak Mathematical Journal

A note on graph colouring

Dănuţ Marcu — 1995

Czechoslovak Mathematical Journal

Note on a Lovász's result

Dănuţ Marcu — 1997

Mathematica Bohemica

In this paper, we give a generalization of a result of Lovasz from [2].

On colouring products of graphs

Dănuţ Marcu — 1996

Mathematica Bohemica

In this paper, we give some results concerning the colouring of the product (cartesian product) of two graphs.

A note on the domination number of a graph and its complement

Dănuţ Marcu — 2001

Mathematica Bohemica

If $G$ is a simple graph of size $n$ without isolated vertices and $\bar{G}$ is its complement, we show that the domination numbers of $G$ and $\bar{G}$ satisfy $γ (G) + γ (\bar{G}) \leq \}\begin{matrix} n - δ + 2 if γ (G) > 3, δ + 3 if γ (\bar{G}) > 3, \end{matrix}$ where $δ$ is the minimum degree of vertices in $G$ .

Note on the Circuits of a Perfect Matroid Design

Danut Marcu — 1984

Publications de l'Institut Mathématique

A Note on a Bermond's Conjecture

Danut Marcu — 1986

Publications de l'Institut Mathématique

Page 1

Download Results (CSV)