scientific article; zbMATH DE number 1153462

MaRDI QIDQ4388214zbMATH OpenFDO

Authors

Publication date 17 May 1998

zbMATH Keywords

colouring numberedge colouringposetstournaments

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Recommendations

• Monochromatic paths and at most 2-coloured arc sets in edge-coloured tournaments
• Monotone reachability in arc-colored tournaments
• On monochromatic paths in m-coloured tournaments
• Tournaments and colouring

Cited in

(32)

• Tournaments and colouring
• \(H\)-cycles in \(H\)-colored multigraphs
• \(H\)-kernels in \(H\)-colored digraphs without \(( \xi_1 , \xi , \xi_2 )-H\)-subdivisions of \(\overrightarrow{C_3} \)
• H-kernels by walks
• \(H\)-kernels in unions of \(H\)-colored quasi-transitive digraphs
• Restricted domination in quasi-transitive and 3-quasi-transitive digraphs
• Some conditions for the existence of Euler H-trails
• \(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs
• \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs
• Reachability problems in edge-colored digraphs
• A generalization of properly colored paths and cycles in edge-colored graphs
• Monotone reachability in arc-colored tournaments
• Richardson's theorem in \(H\)-coloured digraphs
• On panchromatic patterns
• \(H\)-kernels by walks in \(H\)-colored digraphs and the color-class digraph
• \(H\)-kernels in infinite digraphs
• H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs.
• \(H\)-kernels by walks in subdivision digraph
• -panchromatic digraphs
• scientific article; zbMATH DE number 2221116 (Why is no real title available?)
• \((H, k)\)-reachability in \(H\)-arc-colored digraphs
• Trails in arc-colored digraphs avoiding forbidden transitions
• Vertex-pancyclism in edge-colored complete graphs with restrictions in color transitions
• On the existence of cycles with restrictions in the color transitions in edge-colored complete graphs
• Cycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions
• Euler dynamic H -trails in edge-colored graphs
• Dynamic cycles in edge-colored multigraphs
• (k,H)-kernels in nearly tournaments
• Panchromatic patterns by paths
• The theorem of Richardson and its generalizations: a survey
• Restricted reachability in infinite digraphs
• \(\Pi\)-kernels in digraphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4388214)