Some results on an edge coloring problem of Folkman and Fulkerson

DOI10.1016/S0012-365X(00)00061-3zbMath0969.05023MaRDI QIDQ1587594

Armen S. Asratian

Publication date: 3 December 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

edge coloringcolor-feasible sequences

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Solving Matching Problems Efficiently in Bipartite Graphs ⋮ Tensors, matchings and codes

This page was built for publication: Some results on an edge coloring problem of Folkman and Fulkerson