scientific article; zbMATH DE number 4178769
From MaRDI portal
zbMATH Open0715.68035MaRDI QIDQ3201758FDOQ3201758
Authors: Stefan A. Burr
Publication date: 1990
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Generalized Ramsey theory (05C55)
Cited In (16)
- Complexity of Computing the Anti-Ramsey Numbers for Paths.
- What can we hope to accomplish in generalized Ramsey theory ?
- Graph Ramsey theory and the polynomial hierarchy
- On the combination of the Bernays-Schönfinkel-Ramsey fragment with simple linear integer arithmetic
- Trahtenbrot-Zykov problem and NP-completeness
- The complexity of generalized graph colorings
- Title not available (Why is that?)
- On the use of senders in generalized Ramsey theory for graphs
- A packed Ramsey’s theorem and computability theory
- Complexity of computation of some functions of graphs
- Graph Ramsey theory and the polynomial hierarchy
- Title not available (Why is that?)
- Some undecidable problems involving the edge-coloring and vertex-coloring of graphs
- On Ramsey \((4K_2,P_3)\)-minimal graphs
- The complexity of \((P_k, P_\ell ) \)-arrowing
- Co-Nondeterminism in Compositions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3201758)