Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

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

Jozef BuckoPeter MihókJean-François SacléMariusz Woźniak — 2005

Discussiones Mathematicae Graph Theory

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

A Note on Neighbor Expanded Sum Distinguishing Index

Evelyne FlandrinHao LiAntoni MarczykJean-François SacléMariusz Woźniak — 2017

Discussiones Mathematicae Graph Theory

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.

Page 1

Download Results (CSV)