|
|||||
|
|
A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs |
|
| Institution: | Department of Mathematics, Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan 45137-66731, Iran |
| Abstract: | |
| Keywords: | Conditional graph coloring Brooks' Theorem Catlin's Theorem Maximum G-free subgraph Graph partitioning |
| 本文献已被 ScienceDirect 等数据库收录！ | |