Polychromatic Acyclic Tours in Colored Multigraphs

DOI10.1287/MOOR.8.3.471MaRDI QIDQ3328573zbMATH OpenOpenAlexFDO

Authors Douglas H. Blair, Robert A. Pollak

Publication date 1983

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.8.3.471

zbMATH Keywords

edge-coloringvertex-disjoint pathsdirected multigraph

Mathematics Subject Classification ID

Social choice (91B14) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• A polyhedral study of the acyclic coloring problem
• A polyhedral study of the acyclic coloring problem
• Acyclic orientations and the chromatic polynomial
• scientific article; zbMATH DE number 1488856
• Polychromatic colorings of plane graphs
• Polychromatic colorings of plane graphs
• A Tutte Polynomial for Coloured Graphs
• Acyclic coloring of graphs
• Polychromatic colorings and cover decompositions of hypergraphs
• Acyclic edge colorings of graphs

Cited in

(3)

• John A. Weymark
• Coloring graphs using two colors while avoiding monochromatic cycles
• Quasi-decisiveness, quasi-ultrafilter, and social quasi-orderings

This page was built for publication: Polychromatic Acyclic Tours in Colored Multigraphs

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