EuDML | Browse

Page 1

Displaying 1 – 7 of 7

Network tomography.

Berenstein, Carlos A., Gavilánez, Franklin (2007)

Revista Colombiana de Matemáticas

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].

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 highly connected monochromatic subgraphs in 2-colored complete graphs.

Fujita, Shinya, Magnant, Colton (2011)

The Electronic Journal of Combinatorics [electronic only]

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 seed graphs with components of given order.

Fronček, D. (2000)

Acta Mathematica Universitatis Comenianae. New Series

Note on the factors of graphs.

Marcu, Dǎnuţ (2005)

Novi Sad Journal of Mathematics

Displaying 1 – 7 of 7

Network tomography.

Note on a Lovász's result

Note on graphs colouring

Note on highly connected monochromatic subgraphs in 2-colored complete graphs.

Note on $k$ -chromatic graphs

Note on seed graphs with components of given order.

Note on the factors of graphs.

Currently displaying 1 – 7 of 7

Displaying 1 – 7 of 7

Network tomography.

Note on a Lovász's result

Note on graphs colouring

Note on highly connected monochromatic subgraphs in 2-colored complete graphs.

Note on k -chromatic graphs

Note on seed graphs with components of given order.

Note on the factors of graphs.

Currently displaying 1 – 7 of 7

Note on $k$ -chromatic graphs