String graph obstacles of high girth and of bounded degree
From MaRDI portal
Cites work
- A canonical representation of trivalent hamiltonian graphs
- A new approach for contact graph representations and its applications
- Adding one edge to planar graphs makes crossing number and 1-planarity hard
- Bundled crossings revisited
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Graph minors. XIII: The disjoint paths problem
- Graph structure and monadic second-order logic. A language-theoretic approach
- scientific article; zbMATH DE number 3165199 (Why is no real title available?)
- scientific article; zbMATH DE number 3981198 (Why is no real title available?)
- scientific article; zbMATH DE number 4094810 (Why is no real title available?)
- Intersection graphs of curves in the plane
- MSOL restricted contractibility to planar graphs
- On the Möbius Ladders
- On the planar split thickness of graphs
- Parameterized algorithms for beyond-planar crossing numbers
- Recognizing string graphs in NP
- String graphs. I: The number of critical nonstring graphs is infinite
- String graphs. II: Recognizing string graphs is NP-hard
- The monadic second-order logic of graphs. XII: Planar graphs and planar maps
- The monadic second-order logic of graphs. XIII: Graph drawings with edge crossings
- Topology of Thin Film RC Circuits
- Über eine Eigenschaft der ebenen Komplexe.
This page was built for publication: String graph obstacles of high girth and of bounded degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7354815)
