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


List Edge‐Coloring and Total Coloring in Graphs of Low Treewidth
Authors:Henning Bruhn  Richard Lang  Maya Stein
Institution:1. UNIVERSIT?T ULM, Institut für Optimierung und Operations Research, Ulm, GERMANY;2. UNIVERSIDAD DE CHILE, Departamento de Ingeniería Matemática, Santiago, CHILE;3. UNIVERSIDAD DE CHILE, Centre for Mathematical Modeling, Santiago
Abstract:We prove that the list chromatic index of a graph of maximum degree Δ and treewidth urn:x-wiley:03649024:media:jgt21874:jgt21874-math-0001 is Δ; and that the total chromatic number of a graph of maximum degree Δ and treewidth urn:x-wiley:03649024:media:jgt21874:jgt21874-math-0002 is urn:x-wiley:03649024:media:jgt21874:jgt21874-math-0003. This improves results by Meeks and Scott.
Keywords:list colouring  total colouring  tree width
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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