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

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

Displaying similar documents to “Chromatic Polynomials of Mixed Hypercycles”

Pattern hypergraphs.

Dvořák, Zdeněk, Kára, Jan, Král', Daniel, Pangrác, Ondřej (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On planar mixed hypergraphs.

Dvořák, Zdeněk, Král, Daniel (2001)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A Note on Neighbor Expanded Sum Distinguishing Index

Evelyne Flandrin, Hao Li, Antoni Marczyk, Jean-François Saclé, Mariusz Woźniak (2017)

Discussiones Mathematicae Graph Theory

Similarity:

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.

Vertex-distinguishing edge-colorings of linear forests

Sylwia Cichacz, Jakub Przybyło (2010)

Discussiones Mathematicae Graph Theory

Similarity:

In the PhD thesis by Burris (Memphis (1993)), a conjecture was made concerning the number of colors c(G) required to edge-color a simple graph G so that no two distinct vertices are incident to the same multiset of colors. We find the exact value of c(G) - the irregular coloring number, and hence verify the conjecture when G is a vertex-disjoint union of paths. We also investigate the point-distinguishing chromatic index, χ₀(G), where sets, instead of multisets, are required to be distinct,...