Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Games involving graphs (91A43)
Cites work
- scientific article; zbMATH DE number 4199652 (Why is no real title available?)
- scientific article; zbMATH DE number 4081342 (Why is no real title available?)
- scientific article; zbMATH DE number 3715594 (Why is no real title available?)
- scientific article; zbMATH DE number 3732098 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3780579 (Why is no real title available?)
- scientific article; zbMATH DE number 66612 (Why is no real title available?)
- scientific article; zbMATH DE number 3482343 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3641467 (Why is no real title available?)
- scientific article; zbMATH DE number 863469 (Why is no real title available?)
- scientific article; zbMATH DE number 3233758 (Why is no real title available?)
- scientific article; zbMATH DE number 3307332 (Why is no real title available?)
- scientific article; zbMATH DE number 3342867 (Why is no real title available?)
- A Polynomial Algorithm for Constructing a Large Bipartite Subgraph, with an Application to a Satisfiability Problem
- A Theorem on Planar Graphs
- A method in graph theory
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
- An algorithmic approach to the Lovász local lemma. I
- Balancing matrices with line shifts
- Bipartite Subgraphs of Triangle-Free Graphs
- Complexity of Partial Satisfaction
- Every 4-regular graph plus an edge contains a 3-regular subgraph
- Every 7-regular digraph contains an even cycle
- Geometric algorithms and combinatorial optimization
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- How easy is local search?
- Illumination of convex discs
- On Hamilton's ideals
- Some Extremal Properties of Bipartite Subgraphs
- Splitting necklaces
- The Borsuk-Ulam Theorem and Bisection of Necklaces
- The Even Cycle Problem for Directed Graphs
- Three-regular parts of four-regular graphs
- Tournament Ranking with Expected Profit in Polynomial Time
Cited in
(4)
This page was built for publication: On existence theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686508)
