找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Brooks‘ Theorem; Graph Coloring and C Michael Stiebitz,Thomas Schweser,Bjarne Toft Book 2024 The Editor(s) (if applicable) and The Author(s

[复制链接]
查看: 6866|回复: 35
发表于 2025-3-21 16:49:21 | 显示全部楼层 |阅读模式
期刊全称Brooks‘ Theorem
期刊简称Graph Coloring and C
影响因子2023Michael Stiebitz,Thomas Schweser,Bjarne Toft
视频video
发行地址A valuable reference to a wealth of information, scattered in journals, proceedings and dissertations.Gives easy access to a wealth of information, including best known proofs of the results described
学科分类Springer Monographs in Mathematics
图书封面Titlebook: Brooks‘ Theorem; Graph Coloring and C Michael Stiebitz,Thomas Schweser,Bjarne Toft Book 2024 The Editor(s) (if applicable) and The Author(s
影响因子Brooks‘ Theorem (1941) is one of the most famous and fundamental theorems in graph theory – it is mentioned/treated in all general monographs on graph theory. It has sparked research in several directions. This book presents a comprehensive overview of this development and see it in context. It describes results, both early and recent, and explains relations: the various proofs, the many extensions and similar results for other graph parameters. It serves as a valuable reference to a wealth of information, now scattered in journals, proceedings and dissertations. The reader gets easy access to this wealth of information in comprehensive form, including best known proofs of the results described. Each chapter ends in a note section with historical remarks, comments and further results. The book is also suitable for graduate courses in graph theory and includes exercises. The book is intended for readers wanting to dig deeper into graph coloring theory than what is possible in the existing book literature. There is a comprehensive list of references to original sources.
Pindex Book 2024
The information of publication is updating

书目名称Brooks‘ Theorem影响因子(影响力)




书目名称Brooks‘ Theorem影响因子(影响力)学科排名




书目名称Brooks‘ Theorem网络公开度




书目名称Brooks‘ Theorem网络公开度学科排名




书目名称Brooks‘ Theorem被引频次




书目名称Brooks‘ Theorem被引频次学科排名




书目名称Brooks‘ Theorem年度引用




书目名称Brooks‘ Theorem年度引用学科排名




书目名称Brooks‘ Theorem读者反馈




书目名称Brooks‘ Theorem读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:38:02 | 显示全部楼层
Degeneracy and Colorings,loring number and the maximum degree can be arbitrarily large. For example, planar graphs have unbounded maximum degree, but their coloring number is at most 6. While Brooks’ theorem provides a characterization of graphs satisfying . = Δ+ 1, a characterization of graphs satisfying . = col seems to b
发表于 2025-3-22 03:36:33 | 显示全部楼层
发表于 2025-3-22 07:27:39 | 显示全部楼层
发表于 2025-3-22 09:45:18 | 显示全部楼层
https://doi.org/10.1007/978-3-031-50065-7graph coloring; Brooks‘ Theorem; critical graphs; chromatic number; DP-coloring; hypergraph coloring; colo
发表于 2025-3-22 13:27:54 | 显示全部楼层
978-3-031-50067-1The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl
发表于 2025-3-22 19:18:22 | 显示全部楼层
发表于 2025-3-22 21:55:21 | 显示全部楼层
发表于 2025-3-23 01:34:25 | 显示全部楼层
Colorings and Orientations of Graphs,Colorings and orientations of graphs are related in different ways, but the deepness of these relations is notwell understood. In this chapter we reviewsome fundamental results.
发表于 2025-3-23 09:10:10 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-31 23:10
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表