a graph G is called x-uniquely colorable, if all its x-colorings induce the same partion of the vertex set into one-color components. For x-uniquely colorable graphs new bound of the number of vertex set partions into x + 1 cocliques is found. © 2019 gein p.a
AbstractA graph is said to be chromatically unique (or χ-unique) if it is uniquely determined by its...
Let P.G; / be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any gr...
AbstractIn this note, it is shown that the technique employed by Osterweil in producing uniquely 3-c...
Let P(G,x) be a chromatic polynomial of a graph G. Two graphs G and H are called chromatically equiv...
Let \(P(G, x)\) be a chromatic polynomial of a graph \(G\). Two graphs \(G\) and \(H\) are called ch...
AbstractA graph is called uniquely colorable if there is only one partition of its point set into th...
AbstractWe show the following. (1) For each integer n⩾12, there exists a uniquely 3-colorable graph ...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if fo...
The author can archive pre-print, post-print of the article. appropriate journal homepage link is a...
AbstractIn this paper we introduce a chromatic parameter, called the fixing chromatic number, which ...
The join of null graph Om and complete graph Kn, denoted by S(m; n), is called a complete split grap...
AbstractA labeled graph G with chromatic number n is called uniquely n-colorable or simply uniquely ...
AbstractWe prove that graphs obtained from complete equibipartite graphs by deleting some independen...
The study of graph vertex colorability from an algebraic perspective has introduced novel techniques...
AbstractThe study of graph vertex colorability from an algebraic perspective has introduced novel te...
AbstractA graph is said to be chromatically unique (or χ-unique) if it is uniquely determined by its...
Let P.G; / be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any gr...
AbstractIn this note, it is shown that the technique employed by Osterweil in producing uniquely 3-c...
Let P(G,x) be a chromatic polynomial of a graph G. Two graphs G and H are called chromatically equiv...
Let \(P(G, x)\) be a chromatic polynomial of a graph \(G\). Two graphs \(G\) and \(H\) are called ch...
AbstractA graph is called uniquely colorable if there is only one partition of its point set into th...
AbstractWe show the following. (1) For each integer n⩾12, there exists a uniquely 3-colorable graph ...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if fo...
The author can archive pre-print, post-print of the article. appropriate journal homepage link is a...
AbstractIn this paper we introduce a chromatic parameter, called the fixing chromatic number, which ...
The join of null graph Om and complete graph Kn, denoted by S(m; n), is called a complete split grap...
AbstractA labeled graph G with chromatic number n is called uniquely n-colorable or simply uniquely ...
AbstractWe prove that graphs obtained from complete equibipartite graphs by deleting some independen...
The study of graph vertex colorability from an algebraic perspective has introduced novel techniques...
AbstractThe study of graph vertex colorability from an algebraic perspective has introduced novel te...
AbstractA graph is said to be chromatically unique (or χ-unique) if it is uniquely determined by its...
Let P.G; / be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any gr...
AbstractIn this note, it is shown that the technique employed by Osterweil in producing uniquely 3-c...
DOI
Add to ORKG