Pages that link to "Item:Q790841"
From MaRDI portal
The following pages link to A note on the decomposition of graphs into isomorphic matchings (Q790841):
Displaying 28 items.
- Decompositions of complete graphs into circulants (Q294538) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
- Equitable colorings of bounded treewidth graphs (Q817768) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- Polynomial cases of graph decomposition: A complete solution of Holyer's problem (Q1024436) (← links)
- Edge decompositions into two kinds of graphs (Q1045169) (← links)
- Decomposition of large combinatorial structures (Q1107544) (← links)
- A Helly property of arcs (Q1109340) (← links)
- NP-completeness of graph decomposition problems (Q1179032) (← links)
- Random packings of graphs (Q1322245) (← links)
- Edge-disjoint packings of graphs (Q1326750) (← links)
- Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial (Q1354723) (← links)
- Delta-system decompositions of graphs (Q1356709) (← links)
- The mutual exclusion scheduling problem for permutation and comparability graphs. (Q1401918) (← links)
- Clique and anticlique partitions of graphs (Q1584251) (← links)
- Scheduling jobs on identical machines with agreement graph (Q1761988) (← links)
- On some multigraph decomposition problems and their computational complexity (Q1827716) (← links)
- On colored designs. II (Q1842158) (← links)
- Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
- Bounded max-colorings of graphs (Q2447538) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. II (Q2476265) (← links)
- Multigraph decomposition into stars and into multistars (Q2487986) (← links)
- Edge decompositions and rooted packings of graphs (Q2675822) (← links)
- A survey on the existence of<i>G</i>-Designs (Q3528164) (← links)
- Blocking sets for cycles and paths designs (Q4988988) (← links)
- On graphs that have a unique least commonMultiple (Q5074465) (← links)
- On Rooted Packings, Decompositions, and Factors of Graphs (Q5418772) (← links)
