270 citations
- Institute for Solid State Physics and OpticsHU8 papers
- Hungarian Academy of SciencesHU7 papers
- London South Bank UniversityGB7 papers
- Max Planck Institute for Radio AstronomyDE7 papers
- University of AntwerpBE6 papers
- Centre National de la Recherche ScientifiqueFR4 papers
- University of Hong KongHK4 papers
- Center for Astrophysics Harvard & SmithsonianUS3 papers
- The University of SydneyAU3 papers
- AT&T (United States)US2 papers
- Brown UniversityUS2 papers
- California Institute of TechnologyUS2 papers
6 papers · 1 filter
On the structure of graphs with path-width at most two
János Barát, Péter Hajnal, Yixun Lin +1
Nancy G. Kinnersley and Michael A. Langston has determined the excluded minors for the class of graphs with path-width at most two by computer. Their list consisted of 110 graphs.…
Elementary proof techniques for the maximum number of islands
János Barát, Péter Hajnal, Eszter K. Horváth
Islands are combinatorial objects that can be intuitively defined on a board consisting of a finite number of cells. Based on the neighbor relation of the cells, it is a fundamenta…
Finding bipartite subgraphs efficiently
D. Mubayi, G. Turan
Polynomial algorithms are given for the following two problems: given a graph with vertices and edges, where , find a complete balanced bipartite subgraph…
On embedding well-separable graphs
Béla Csaba
Call a simple graph of order well-separable, if by deleting a separator set of size the leftover will have components of size at most . We prove, that bounded…
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness
Janos Barat, Jiri Matousek, David R. Wood
The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppstein [Separa…
Direct construction of code loops
Gabor P. Nagy
Code loops were introduced by R. L. Griess. R.L. Griess and T. Hsu gave methods to construct the corresponding code loop from any given doubly even binary code; both these methods…