On existence theorems
From MaRDI portal
Publication:686508
DOI10.1016/0012-365X(93)90180-2zbMath0803.05046MaRDI QIDQ686508
Publication date: 20 December 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items (2)
Regular codes in regular graphs are difficult ⋮ The complexity of finding a second Hamiltonian cycle in cubic graphs
Cites Work
- Three-regular parts of four-regular graphs
- Balancing matrices with line shifts
- Every 4-regular graph plus an edge contains a 3-regular subgraph
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
- Splitting necklaces
- How easy is local search?
- Every 7-regular digraph contains an even cycle
- Geometric algorithms and combinatorial optimization
- A method in graph theory
- On Hamilton's ideals
- A Theorem on Planar Graphs
- Tournament Ranking with Expected Profit in Polynomial Time
- Complexity of Partial Satisfaction
- A Polynomial Algorithm for Constructing a Large Bipartite Subgraph, with an Application to a Satisfiability Problem
- An algorithmic approach to the Lovász local lemma. I
- The Even Cycle Problem for Directed Graphs
- Illumination of convex discs
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- Bipartite Subgraphs of Triangle-Free Graphs
- The Borsuk-Ulam Theorem and Bisection of Necklaces
- Some Extremal Properties of Bipartite Subgraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On existence theorems
