71 search results - page 9 / 15 » Characterizing path graphs by forbidden induced subgraphs |
JGT
2006
13 years 7 months ago
2006
An edge-colored graph H is properly colored if no two adjacent edges of H have the same color. In 1997, J. Bang-Jensen and G. Gutin conjectured that an edgecolored complete graph ...
NETWORKING
2007
13 years 8 months ago
2007
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
SIAMDM
1998
13 years 7 months ago
1998
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
EJC
2008
13 years 5 months ago
2008
Let be a G-symmetric graph, and let B be a nontrivial G-invariant partition of the vertex set of . This paper aims to characterize (, G) under the conditions that the quotient gr...
IWOCA
2010
Springer
13 years 2 months ago
2010
Springer
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...