首页 | 本学科首页   官方微博 | 高级检索  
     


Some remarks on (k−1)-critical subgraphs ofk-critical graphs
Authors:H. L. Abbott  B. Zhou
Affiliation:(1) Department of Mathematics, University of Alberta, T6G 2G1 Edmonton, Alberta, Canada;(2) Department of Mathematics, Trent University, K9J 7B8 Peterborough, Ontario, Canada
Abstract:A graphG is said to bek-critical if it has chromatic numberk, but every proper subgraph ofG has a (k–1)-coloring. Gallai asked whether every largek-critical graph contains many (k–1)-critical subgraphs. We provide some information concerning this question and some related questions.
Keywords:05 C 15  05 C 35
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号