641 search results - page 2 / 129 » On Planar Quasi-Parity Graphs |
SODA
2010
ACM
14 years 4 months ago
2010
ACM
DMTCS
2010
13 years 4 months ago
2010
We proved that every planar triangle-free graph with n vertices has a subset of vertices that induces a forest of size at least (71n + 72)/128. This improves the earlier work of S...
INFOCOM
2011
IEEE
12 years 10 months ago
2011
IEEE
—Extracting planar graph from network topologies is of great importance for efficient protocol design in wireless ad hoc and sensor networks. Previous techniques of planar topol...
COCOON
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
SIAMDM
2000
13 years 6 months ago
2000
We establish that every cyclically 4-connected cubic planar graph of order at most 40 is hamiltonian. Furthermore, this bound is determined to be sharp and we present all nonhamil...