Another two graphs with no planar covers

By Petr Hliněný. 2001

119 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics

View Paper: https://www.semanticscholar.org/paper/c46827b55b893dcecf43395c406cfb458d0743cc

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Gayathri Mahalingam
2. Benny Sudakov

In Discrete Mathematics and Combinatorics

1. Gayathri Mahalingam
2. Benny Sudakov

Citations in the corpus

• Connected domination in graphs (2005, methodology): “3 [15] Every connected graph G with k ≥ 3 has a spanning tree with at least n/4 + 2 leaves.”
• Large K r -free subgraphs in K s -free graphs and some other Ramsey-type problems (2005, methodology): “This process and its extensions were recently developed by various researches and successfully applied to different Ramsey and Turan type problems (see, e.g., [21], [15], [3], [ 14 ], [12], and their references).”