Pages that link to "Item:Q1331890"
From MaRDI portal
The following pages link to Packing problems in edge-colored graphs (Q1331890):
Displaying 13 items.
- An extremal problem for vertex partition of complete multipartite graphs (Q267182) (← links)
- Induced graph packing problems (Q604669) (← links)
- Complexity of the packing coloring problem for trees (Q972338) (← links)
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results (Q1015318) (← links)
- Edge-disjoint packings of graphs (Q1326750) (← links)
- Generalized matrix projective synchronization of general colored networks with different-dimensional node dynamics (Q1660333) (← links)
- Alternating paths in edge-colored complete graphs (Q1842658) (← links)
- Locality-preserving allocations problems and coloured bin packing (Q2355699) (← links)
- The packing coloring problem for lobsters and partner limited graphs (Q2448872) (← links)
- Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees (Q2479574) (← links)
- Minimal colorings for properly colored subgraphs (Q2563425) (← links)
- Adaptive synchronization and pinning control of colored networks (Q2944645) (← links)
- The mixed vertex packing problem. (Q5926330) (← links)