Search results
From MaRDI portal
- Subdivisions in apex graphs 2013-08-02 Paper On r‐Connected Graphs with No Semi‐topological r‐Wheel 2013-04-19 Paper Extremal results regarding \(K_6\)-minors in graphs...10 bytes (19 words) - 02:35, 10 December 2023
- random graphs 1994-04-05 Paper Rational Samuelson maps are univalent 1994-04-04 Paper On the rotation distance of graphs 1994-04-04 Paper Minors of quasi...10 bytes (15 words) - 13:11, 24 September 2023
- Brave) zbMATH Keywords planar graphs; interval graphs; parameterized complexity; \(d\)-degenerate graphs; apex-minor-free graphs; perfectly matched sets Mathematics...15 bytes (56 words) - 17:15, 25 April 2024
- Keywords distance in graphs; planar graphs; treewidth; graph algorithms; spanners; parametrized complexity; apex-minor-free graphs Mathematics Subject Classification...15 bytes (90 words) - 09:53, 30 January 2024
- 01.003 zbMATH Keywords fixed-parameter tractability; branchwidth; apex-minor-free graphs; (total) vector dominating set; partial dominating set Mathematics...15 bytes (85 words) - 07:47, 1 February 2024
- 1007/978-3-642-25011-8_2 zbMATH Keywords chordal graphs; fixed-parameter tractability; dominator coloring; apex-minor-free graphs Mathematics Subject Classification...15 bytes (105 words) - 22:50, 3 February 2024
- degree-diameter problem; sparse graph; apex-minor-free graph; surface graph Mathematics Subject Classification ID 05C10: Planar graphs; geometric and topological...15 bytes (77 words) - 06:07, 30 January 2024
- 1007/978-3-030-50026-9_16 zbMATH Keywords treewidth; facility location; apex-minor-free graph; W[1-hard]; subexponential parameterized algorithm Mathematics Subject...15 bytes (70 words) - 12:05, 8 February 2024
- regular background grid. 2004-07-01 Paper A solution to the word problem for free pseudosemilattices 2004-07-01 Paper Equivalence of the Stone-Weierstrass...10 bytes (15 words) - 11:36, 24 September 2023
- k-arboretum of graphs with bounded treewidth, Apex graphs with embeddings of face-width three, On the invariance of Colin de Verdière's graph parameter under...15 bytes (106 words) - 18:46, 6 February 2024
- The obstructions of a minor-closed set of graphs defined by a context-free grammar, Logical description of context-free graph languages, \(L(A)=L(B)\)...15 bytes (497 words) - 14:18, 5 February 2024
- monadic second-order logic of graphs. X: Linear orderings, The obstructions of a minor-closed set of graphs defined by a context-free grammar, On interval routing...15 bytes (559 words) - 11:23, 3 February 2024
- obstructions of a minor-closed set of graphs defined by a context-free grammar, Logical description of context-free graph languages, Parallel high-level replacement...15 bytes (340 words) - 10:26, 30 January 2024
- Amalgamated free products of inverse semigroups, Cayley automata, Orientable quadrilateral embedding of products of graphs, Regular maps from Cayley graphs. I:...15 bytes (312 words) - 11:42, 6 February 2024
- minimum size of a vertex pancyclic graph, Claw-free graphs---a survey, Matching extension in \(K_{1,r}\)-free graphs with independent claw centers, Path...15 bytes (3,716 words) - 03:21, 9 February 2024
- polynomial time, The monadic second-order logic of graphs. VII: Graphs as relational structures, Context-free hypergraph grammars have the same term-generating...15 bytes (364 words) - 02:42, 31 January 2024
- structures, Context-free graph languages of bounded degree are generated by apex graph grammars, Logical description of context-free graph languages, A comparison...15 bytes (435 words) - 04:30, 8 February 2024
- recognizability, The monadic second-order logic of graphs. VII: Graphs as relational structures, Context-free hypergraph grammars have the same term-generating...15 bytes (242 words) - 14:28, 5 February 2024
- context-free rewriting and its application to NLC graph grammars On the structure of node-label-controlled graph languages Complement reducible graphs The...15 bytes (454 words) - 18:56, 2 February 2024
