253 search results - page 4 / 51 » Perfection thickness of graphs |
SIAMNUM
2010
14 years 4 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...
84
Voted
ARSCOM
2008
14 years 8 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
14 years 9 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...
75
Voted
PCI
2005
Springer
15 years 3 months 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...
83
Voted
APPML
2007
14 years 9 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...