scientific article
From MaRDI portal
Publication:3882513
zbMath0441.10001MaRDI QIDQ3882513
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Euler functioncomplete sequencesproducts of consecutive integersdistinct prime factorsdichromatic number of directed graphiteration of number theoretic functions
Problem books (00A07) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Coloring of graphs and hypergraphs (05C15) Arithmetic functions; related numbers; inversion formulas (11A25) Directed graphs (digraphs), tournaments (05C20) Primes (11A41) Sequences and sets (11B99)
Related Items (24)
On kernel-perfect critical digraphs ⋮ Uniquely colourable m-dichromatic oriented graphs ⋮ The 3 and 4-dichromatic tournaments of minimum order ⋮ Vertex critical 4-dichromatic circulant tournaments ⋮ The minimum number of edges in 4-critical digraphs of given order ⋮ Disproof of a conjecture of Neumann-Lara ⋮ On coloring digraphs with forbidden induced subgraphs ⋮ The smallest 5-chromatic tournament ⋮ Subdivisions with congruence constraints in digraphs of large chromatic number ⋮ Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of \(P_4\) ⋮ Strengthening the directed Brooks' theorem for oriented graphs and consequences on digraph redicolouring ⋮ Cycle reversions and dichromatic number in tournaments ⋮ Extending kernel perfect digraphs to kernel perfect critical digraphs ⋮ Coloring digraphs with forbidden cycles ⋮ The dichromatic number of infinite families of circulant tournaments ⋮ Extension of Gyárfás-Sumner conjecture to digraphs ⋮ Convex circuit-free coloration of an oriented graph ⋮ The chromatic polynomial of a digraph ⋮ Dichromatic number and forced subdivisions ⋮ The dichromatic number of a digraph ⋮ The acyclic disconnection of a digraph ⋮ Vertex critical r-dichromatic tournaments ⋮ Digraphs with all induced directed cycles of the same length are not \(\vec{\chi}\)-bounded ⋮ A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number
This page was built for publication:
