All wheels with two missing consecutive spokes are chromatically unique
- Dong, F.M.
- Liu, Y.P.
DOIAbstract
AbstractThis paper shows that every wheel of order n, n⩾ 6, with two missing consecutive spokes is chromatically unique
AbstractThis paper shows that every wheel of order n, n⩾ 6, with two missing consecutive spokes is chromatically unique
AbstractLet W(n,k) denote the graph of order n obtained from a wheel Wn by deleting all but k consec...
AbstractLet W(n, k) denote the graph of order n obtained from the wheel Wn by deleting all but k con...
AbstractLet W(n, m) denote the graph of order n obtained from the wheel Wn be deleting all but m con...
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...
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...
AbstractXu and Li proved the chromatic uniqueness of wheels on an odd number of vertices. It is know...
AbstractWe show that the graph Un+1 obtained from the Wheel Wn+1 by deleting one spoke is chromatica...
AbstractLet W(n, m) denote the graph of order n obtained from the wheel Wn be deleting all but m con...
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 ...
AbstractLet W(n, k) denote the graph of order n obtained from the wheel Wn by deleting all but k con...
AbstractFor k⩾1 the odd wheel of 2k+1 spokes, denoted by W2k+1, is the graph obtained from a cycle o...
AbstractLet W(n,k) denote the graph of order n obtained from a wheel Wn by deleting all but k consec...
AbstractLet W(n, k) denote the graph of order n obtained from the wheel Wn by deleting all but k con...
AbstractLet W(n, m) denote the graph of order n obtained from the wheel Wn be deleting all but m con...
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...
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...
AbstractXu and Li proved the chromatic uniqueness of wheels on an odd number of vertices. It is know...
AbstractWe show that the graph Un+1 obtained from the Wheel Wn+1 by deleting one spoke is chromatica...
AbstractLet W(n, m) denote the graph of order n obtained from the wheel Wn be deleting all but m con...
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 ...
AbstractLet W(n, k) denote the graph of order n obtained from the wheel Wn by deleting all but k con...
AbstractFor k⩾1 the odd wheel of 2k+1 spokes, denoted by W2k+1, is the graph obtained from a cycle o...
AbstractLet W(n,k) denote the graph of order n obtained from a wheel Wn by deleting all but k consec...
AbstractLet W(n, k) denote the graph of order n obtained from the wheel Wn by deleting all but k con...
AbstractLet W(n, m) denote the graph of order n obtained from the wheel Wn be deleting all but m con...
Add to ORKG