Publication date
June 1990
DOI Publisher
Published by Elsevier B.V. ISSN
0012-365XAbstract
AbstractWe show that the graph Un+1 obtained from the Wheel Wn+1 by deleting one spoke is chromatically unique if n⩾3 is odd
AbstractWe show that the graph Un+1 obtained from the Wheel Wn+1 by deleting one spoke is chromatically unique if n⩾3 is odd
AbstractIn this note, it is shown that all graphs Fn,k for odd integer n ⩾ 5, and integer k ⩾ 1 are ...
Let the vertices of a graph such that every two adjacent vertices have different color is a very com...
Let the vertices of a graph such that every two adjacent vertices have different color is a very com...
AbstractIn the previous paper, it was shown that the graph Un + 1 obtained from the wheel Wn + 1 by ...
AbstractThis paper shows that every wheel of order n, n⩾ 6, with two missing consecutive spokes is c...
AbstractIn the previous paper, it was shown that the graph Un + 1 obtained from the wheel Wn + 1 by ...
AbstractWe show that the graph Un+1 obtained from the Wheel Wn+1 by deleting one spoke is chromatica...
AbstractLet W(n,k) denote the graph of order n obtained from a wheel Wn by deleting all but k consec...
AbstractLet W(n, m) denote the graph of order n obtained from the wheel Wn be deleting all but m con...
AbstractLet W(n, k) denote the graph of order n obtained from the wheel Wn by deleting all but k con...
AbstractLet W(n,k) denote the graph of order n obtained from a wheel Wn by deleting all but k consec...
A graph G is chromatically unique if its chromatic polynomial completely determines the graph. An n-...
AbstractLet W(n, m) denote the graph of order n obtained from the wheel Wn be deleting all but m con...
AbstractThis paper shows that every wheel of order n, n⩾ 6, with two missing consecutive spokes is c...
AbstractXu and Li proved the chromatic uniqueness of wheels on an odd number of vertices. It is know...
AbstractIn this note, it is shown that all graphs Fn,k for odd integer n ⩾ 5, and integer k ⩾ 1 are ...
Let the vertices of a graph such that every two adjacent vertices have different color is a very com...
Let the vertices of a graph such that every two adjacent vertices have different color is a very com...
AbstractIn the previous paper, it was shown that the graph Un + 1 obtained from the wheel Wn + 1 by ...
AbstractThis paper shows that every wheel of order n, n⩾ 6, with two missing consecutive spokes is c...
AbstractIn the previous paper, it was shown that the graph Un + 1 obtained from the wheel Wn + 1 by ...
AbstractWe show that the graph Un+1 obtained from the Wheel Wn+1 by deleting one spoke is chromatica...
AbstractLet W(n,k) denote the graph of order n obtained from a wheel Wn by deleting all but k consec...
AbstractLet W(n, m) denote the graph of order n obtained from the wheel Wn be deleting all but m con...
AbstractLet W(n, k) denote the graph of order n obtained from the wheel Wn by deleting all but k con...
AbstractLet W(n,k) denote the graph of order n obtained from a wheel Wn by deleting all but k consec...
A graph G is chromatically unique if its chromatic polynomial completely determines the graph. An n-...
AbstractLet W(n, m) denote the graph of order n obtained from the wheel Wn be deleting all but m con...
AbstractThis paper shows that every wheel of order n, n⩾ 6, with two missing consecutive spokes is c...
AbstractXu and Li proved the chromatic uniqueness of wheels on an odd number of vertices. It is know...
AbstractIn this note, it is shown that all graphs Fn,k for odd integer n ⩾ 5, and integer k ⩾ 1 are ...
Let the vertices of a graph such that every two adjacent vertices have different color is a very com...
Let the vertices of a graph such that every two adjacent vertices have different color is a very com...
Add to ORKG