On three blocks paths P (k, l, r)
From MaRDI portal
Publication:2081489
Cites work
- About paths with two blocks
- Cycles with two blocks in k-chromatic digraphs
- Diconnected Orientations and a Conjecture of Las Vergnas
- Graph Theory and Probability
- Graph-theoretical methods in general function theory
- scientific article; zbMATH DE number 3708430 (Why is no real title available?)
- scientific article; zbMATH DE number 7370928 (Why is no real title available?)
- scientific article; zbMATH DE number 7560305 (Why is no real title available?)
- scientific article; zbMATH DE number 3257176 (Why is no real title available?)
- Nombre chromatique et plus longs chemins d'un graphe
- Oriented trees in digraphs
- Paths with two blocks in \(n\)-chromatic digraphs
- Subdivisions of oriented cycles in digraphs with large chromatic number
- Zur algebraischen Begründung der Graphentheorie. I
Cited in
(6)- Subdivisions of oriented cycles in Hamiltonian digraphs with small chromatic number
- scientific article; zbMATH DE number 7560305 (Why is no real title available?)
- Existence of paths with t blocks in k ( t )-chromatic digraph
- Oriented Hamiltonian paths in digraphs with arbitrary chromatic number
- Oriented trees in \(O(k \sqrt{k})\)-chromatic digraphs, a subquadratic bound for Burr's conjecture
- On paths with three blocks of the form P(1, k, 1) in digraphs
This page was built for publication: On three blocks paths \(P (k, l, r)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2081489)