Panchromatic patterns by paths

DOI10.7151/DMGT.2459MaRDI QIDQ6985925zbMATH OpenFDO

Authors Germán Benítez-Bobadilla, Hortensia Galeana-Sánchez, César Hernández-Cruz

Publication date 12 May 2025

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2459

zbMATH Keywords

\(H\)-arc-coloured digraphpattern of colours

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Cites work

• A dichotomy for the kernel by H‐walks problem in digraphs
• A lower bound on the size of an absorbing set in an arc-coloured tournament
• A proof of the Erdös-Sands-Sauer-Woodrow conjecture
• Absorbing sets in arc-coloured tournaments
• Alternating kernels
• Characterization of color patterns by dynamic \(H\)-paths
• Digraphs
• Graph theory
• scientific article; zbMATH DE number 1153462 (Why is no real title available?)
• On monochromatic paths in edge-coloured digraphs
• On panchromatic patterns
• Reachability problems in edge-colored digraphs

Cited in

(1)

• The theorem of Richardson and its generalizations: a survey

This page was built for publication: Panchromatic patterns by paths

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