지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 발행연도
- 2016.1
- 수록면
- 647 - 655 (9page)
이용수
초록· 키워드
오류제보하기
Let $H$ be a graph, and $k\geq \chi(H)$ an integer.
We say that $H$ has a {\em cyclic Gray code of $k$-colourings} if and only ifit is possible to list all its $k$-colourings in such a way thatconsecutive colourings, including the last and the first, agree on allvertices of $H$ except one.
The Gray code number of $H$ is the least integer $k_0(H)$such that $H$ has a cyclic Gray code of its $k$-colouringsfor all $k\geq k_0(H)$.
For complete bipartite graphs, we prove that$k_0(K_{\ell,r})=3$ when both $\ell$ and $r$ are odd, and$k_0(K_{\ell,r})=4$ otherwise.
목차
등록된 정보가 없습니다.
참고문헌 (14)
참고문헌 신청
S. Bard / 2014 / Colour graphs of complete multipartite graphs
J. A. Bondy / 2008 / Graph Theory, GTM 224 / Springer
P. Bonsma / 2009 / Finding paths between graph colourings: PSPACEcompleteness and superpolynomial distances / Theoretical Computer Science 410:5215~5226
L. Cereceda / 2008 / Connectedness of the graph of vertex colourings / Discrete Math. 308:913~919
L. Cereceda / 2009 / Mixing 3-colourings in bipartite graphs / European J. Combin. 30:1593~1606
J. A. Bondy / 2008 / Graph Theory, GTM 224 / Springer
P. Bonsma / 2009 / Finding paths between graph colourings: PSPACEcompleteness and superpolynomial distances / Theoretical Computer Science 410:5215~5226
L. Cereceda / 2008 / Connectedness of the graph of vertex colourings / Discrete Math. 308:913~919
L. Cereceda / 2009 / Mixing 3-colourings in bipartite graphs / European J. Combin. 30:1593~1606
함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
Colourings and the Alexander Polynomial
Kyungpook Mathematical Journal
2016 .01
-
Right-angled Artin groups on path graphs, cycle graphs and complete bipartite graphs
한국수학논문집
2021 .09
-
Graph Equations Involving Tensor Product of Graphs
Kyungpook Mathematical Journal
2017 .06
-
$H$-$V$-super magic decomposition of complete bipartite graphs
대한수학회논문집
2015 .01
-
Some Properties of q-Distance Energy
Advanced Studies in Contemporary Mathematics
2020 .01
-
ON HARMONIOUS COLORINGS OF LEXICOGRAPHIC PRODUCT OF GRAPHS
Advanced Studies in Contemporary Mathematics
2021 .04
-
METRIC DIMENSION AND ITS VARIATIONS OF CHAIN GRAPHS
Proceedings of the Jangjeon Mathematical Society
2021 .07
-
Total domination number of central graphs
대한수학회보
2019 .01
-
On the annihilator graph of group rings
대한수학회보
2017 .01
-
Induced signed graphs of some classes of graphs
Proceedings of the Jangjeon Mathematical Society
2020 .01
-
Stable and robust $\ell_p$-constrained compressive sensing recovery via robust width property
대한수학회지
2019 .01
-
Complexity Issues of Perfect Roman Domination in Graphs
Kyungpook Mathematical Journal
2021 .09
-
A sufficient condition for hyponormal Toeplitz operators on the Bergman space
대한수학회보
2024 .07
-
On co-well covered graphs
대한수학회논문집
2020 .01
-
CHARACTERISTIC POLYNOMIALS OF SUBDIVISION GRAPHS
Advanced Studies in Contemporary Mathematics
2021 .01
-
Spectra of F-sum graphs and F-product graphs
Proceedings of the Jangjeon Mathematical Society
2018 .01
-
New results on the F-index of graphs based on Corona-type products of graphs
Proceedings of the Jangjeon Mathematical Society
2020 .01
-
On the matching number and the independence number of a random induced subhypergraph of a hypergraph
대한수학회보
2018 .01
-
SIGNED A-POLYNOMIALS OF GRAPHS AND POINCAR´E POLYNOMIALS OF REAL TORIC MANIFOLDS
대한수학회보
2015 .01
-
On rings whose annihilating-ideal graphs are blow-ups of a class of Boolean graphs
대한수학회지
2017 .01
이 논문의 저자 정보
최근 본 자료
댓글(0)
0