Uniquely colorable graph

Known as: Uniquely edge-colorable graph, Uniquely total colorable graph

In graph theory, a uniquely colorable graph is a k-chromatic graph that has only one possible (proper) k-coloring up to permutation of the colors.

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

K. Ichihara and E. Matsudo introduced the notions of $\mathbb{Z}$-colorable links and the minimal coloring number for $\mathbb{Z…

2017

ABSTRACT A graph G is uniquely k-colourable if the chromatic number of G is k and G has only one k-colouring up to permutation of…

2016

Abstract For a given list assignment $L\,=\,\{L\left( v \right)\,:\,v\,\in \,V\left( G \right)\}$ , a graph $G\,=\,\left( V,\,E…

2015

This paper extends our previous work on graph oversampling for graph signal processing. In the graph oversampling method, nodes…

2013

A graph $G$ is uniquely $k$-colorable if the chromatic number of $G$ is $k$ and $G$ has only one $k$-coloring up to permutation…

2013

In 1970 Michael Plummer introduced the notion of well-coveredness of graphs [13]. A graph is called well-covered if all of its…

1998

1998

A k-chromatic graph G is called uniquely k-colorable if every k-coloring of the vertex set V of G induces the same partition of V…

Review

1990

Review

1990

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important…

1958

Let 3C be hilbert space (any dimensionality, real or complex scalars). Let P be a hermitian projection. Let A be any hermitian…