253 search results - page 4 / 51 » Perfection thickness of graphs |
SIAMNUM
2010
13 years 2 months ago
2010
In this paper, we propose a uniaxial perfectly matched layer (PML) method for solving the time-harmonic scattering problems in two-layered media. The exterior region of the scatter...
ARSCOM
2008
13 years 6 months ago
2008
A total perfect code in a graph is a subset of the graph's vertices with the property that each vertex in the graph is adjacent to exactly one vertex in the subset. We prove t...
JGAA
2008
13 years 7 months ago
2008
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines...
PCI
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. In this paper, we address the problem of computing a maximum-size subgraph of a P4-sparse graph which admits a perfect matching; in the case where the graph has a perfect...
APPML
2007
13 years 7 months ago
2007
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...