Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

A note on maximal common subgraphs of the Dirac's family of graphs

100%

Bucko J., Mihók P., Saclé J.-F., Woźniak M.

Discussiones Mathematicae Graph Theory

2005

tom 25

nr 3

385-390

Let 𝓕 ⁿ be a given set of unlabeled simple graphs of order n. A maximal common subgraph of the graphs of the set 𝓕 ⁿ is a common subgraph F of order n of each member of 𝓕 ⁿ, that is not properly contained in any larger common subgraph of each member of 𝓕 ⁿ. By well-known Dirac's Theorem, the Dirac's family 𝓓𝓕 ⁿ of the graphs of order n and minimum degree δ ≥ [n/2] has a maximal common subgraph containing Cₙ. In this note we study the problem of determining all maximal common subgraphs of the Dirac's family $𝓓 𝓕 ^{2n}$ for n ≥ 2.

A Note on Neighbor Expanded Sum Distinguishing Index

88%

Flandrin E., Li H., Marczyk A., Saclé J.-F., Woźniak M.

Discussiones Mathematicae Graph Theory

2017

tom 37

nr 1

29-37

A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set [k] = {1, . . . , k}. These colors can be used to distinguish the vertices of G. There are many possibilities of such a distinction. In this paper, we consider the sum of colors on incident edges and adjacent vertices.

Ograniczanie wyników

2 Discussiones Mathematicae Graph Theory

2 Saclé J.-F.

2 Woźniak M.

1 Bucko J.

1 Flandrin E.

1 Li H.

1 Marczyk A.

1 Mihók P.

1 2017

1 2005

Wyniki wyszukiwania

A note on maximal common subgraphs of the Dirac's family of graphs

A Note on Neighbor Expanded Sum Distinguishing Index