Extension of Turan's and Brooks' Theorems and New Notions of Stability and Coloring in Digraphs
From MaRDI portal
Publication:3039377
DOI10.1016/S0304-0208(08)73409-1zbMath0525.05027MaRDI QIDQ3039377
Publication date: 1983
Published in: Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics (Search for Journal in Brave)
Related Items (16)
Infinite quasi-transitive digraphs with domination number 2 ⋮ On the contractibility of a digraph onto \(K_ 4^*\) ⋮ Turán number of 3-free strong digraphs with out-degree restriction ⋮ Unnamed Item ⋮ Positive matching decompositions of graphs ⋮ Game-perfect digraphs ⋮ Vertex coloring acyclic digraphs and their corresponding hypergraphs ⋮ The dichromatic number of infinite families of circulant tournaments ⋮ A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints ⋮ Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints ⋮ Extremal digraphs avoiding an orientation of \(C_4\) ⋮ The acyclic disconnection of a digraph ⋮ Perfect Digraphs ⋮ Some of My Favorite Coloring Problems for Graphs and Digraphs ⋮ The extremal function for complete minors ⋮ Relaxed chromatic numbers of graphs
This page was built for publication: Extension of Turan's and Brooks' Theorems and New Notions of Stability and Coloring in Digraphs
