Pages that link to "Item:Q3833885"
From MaRDI portal
The following pages link to On the separation number of a graph (Q3833885):
Displaying 24 items.
- Tabu search for the cyclic bandwidth problem (Q337475) (← links)
- Graphs of separability at most 2 (Q415268) (← links)
- A special antidilation problem for meshes and Hamming graphs (Q432721) (← links)
- A note on maximum differential coloring of planar graphs (Q473207) (← links)
- Memetic algorithm for the antibandwidth maximization problem (Q623314) (← links)
- Separation numbers of trees (Q837168) (← links)
- Antibandwidth of three-dimensional meshes (Q960961) (← links)
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes (Q1025547) (← links)
- On explicit formulas for bandwidth and antibandwidth of hypercubes (Q1026164) (← links)
- Antibandwidth of complete \(k\)-ary trees (Q1045176) (← links)
- The vertex separation number of a graph equals its path-width (Q1198094) (← links)
- Eigenvalues and separation in graphs (Q1209408) (← links)
- How many steps are necessary to separate a bigraph? (Q1850581) (← links)
- Scheduling dyadic intervals (Q1902894) (← links)
- A note on computational approaches for the antibandwidth problem (Q2051212) (← links)
- A general variable neighborhood search for the cyclic antibandwidth problem (Q2114825) (← links)
- On the number of edges of separated multigraphs (Q2151445) (← links)
- The maximum \(k\)-differential coloring problem (Q2407949) (← links)
- Antibandwidth and cyclic antibandwidth of Hamming graphs (Q2446319) (← links)
- Antibandwidth and cyclic antibandwidth of Hamming graphs (Q2851478) (← links)
- The Cyclic Antibandwidth Problem (Q3439338) (← links)
- Antibandwidth of Complete k-Ary Trees (Q3439448) (← links)
- Antibandwidth of Three-Dimensional Meshes (Q3439580) (← links)
- Level-based heuristics and hill climbing for the antibandwidth maximization problem (Q4982954) (← links)
