Packing problems in edge-colored graphs
From MaRDI portal
Publication:1331890
DOI10.1016/0166-218X(94)90148-1zbMath0806.05054OpenAlexW2049529758MaRDI QIDQ1331890
Zsolt Tuza, Yannis Manoussakis, Pavol Hell
Publication date: 14 February 1995
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(94)90148-1
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items
An extremal problem for vertex partition of complete multipartite graphs, Generalized matrix projective synchronization of general colored networks with different-dimensional node dynamics, Adaptive synchronization and pinning control of colored networks, Minimal colorings for properly colored subgraphs, Alternating paths in edge-colored complete graphs
Cites Work