Pages that link to "Item:Q2706174"
From MaRDI portal
The following pages link to SIAM Journal on Discrete Mathematics (Q2706174):
Displaying 23 items.
- On the Carathéodory Number for the Convexity of Paths of Order Three (Q4899035) (← links)
- A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs (Q4899036) (← links)
- Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It (Q4915184) (← links)
- Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven (Q5189502) (← links)
- Matchings and Nonrainbow Colorings (Q5189521) (← links)
- Spanning Directed Trees with Many Leaves (Q5189530) (← links)
- Editing to Connected F-Degree Graph (Q5232130) (← links)
- Noncrossing Arc Diagrams and Canonical Join Representations (Q5254018) (← links)
- TSP Tours in Cubic Graphs: Beyond 4/3 (Q5254089) (← links)
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve (Q5285942) (← links)
- A Lower Bound for the Complexity of Monotone Graph Properties (Q5300493) (← links)
- Bidimensional Parameters and Local Treewidth (Q5317565) (← links)
- The Cover Time of Random Regular Graphs (Q5317583) (← links)
- Hamilton Cycles in Random Graphs with a Fixed Degree Sequence (Q5392910) (← links)
- The Last Fraction of a Fractional Conjecture (Q5392921) (← links)
- Improved Bounds for the Crossing Numbers of Km,n and Kn (Q5470826) (← links)
- Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk (Q5743552) (← links)
- Long Circuits and Large Euler Subgraphs (Q5891185) (← links)
- Counting Subgraphs via Homomorphisms (Q5891745) (← links)
- A Subexponential Parameterized Algorithm for Proper Interval Completion (Q5899484) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6499010) (← links)
- Hypergraph Horn functions (Q6499011) (← links)
- A Menger-type theorem for two induced paths (Q6499012) (← links)
