Pages that link to "Item:Q4841789"
From MaRDI portal
The following pages link to Stable networks and product graphs (Q4841789):
Displayed 25 items.
- On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes (Q463287) (← links)
- Sex-equal stable matchings: complexity and exact algorithms (Q528851) (← links)
- On optimizing edge connectivity of product graphs (Q626866) (← links)
- Some results on the lexicographic product of vertex-transitive graphs (Q654220) (← links)
- A poset-based approach to embedding median graphs in hypercubes and lattices (Q766140) (← links)
- Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations (Q976091) (← links)
- On a simple randomized algorithm for finding a 2-factor in sparse graphs (Q1041775) (← links)
- Study on specialist outpatient matching appointment and the balance matching model (Q1740392) (← links)
- Understanding the generalized median stable matchings (Q1959721) (← links)
- Medians in median graphs and their cube complexes in linear time (Q2119403) (← links)
- Constrained stable marriage with free edges or few blocking pairs (Q2150572) (← links)
- The algebra of metric betweenness. I: Subdirect representation and retraction (Q2372427) (← links)
- Computing median and antimedian sets in median graphs (Q2379917) (← links)
- Strong edge geodetic problem in networks (Q2409583) (← links)
- Edge-coloring almost bipartite multigraphs (Q2444912) (← links)
- Motion planning in Cartesian product graphs (Q2450121) (← links)
- Characterizing flag graphs and incuced subgraphs of Cartesian product graphs (Q2573719) (← links)
- The complexity of the comparator circuit value problem (Q2828221) (← links)
- Computing on structures (Q4630296) (← links)
- Retracts of Products of Chordal Graphs (Q4920657) (← links)
- On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) (Q5062116) (← links)
- On Boolean Automata Networks (de)Composition1 (Q5158663) (← links)
- Balanced stable marriage: how close is close enough? (Q5918373) (← links)
- Fanout limitations on constraint systems (Q5941073) (← links)
- On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets (Q6063279) (← links)