Reinhard Diestel. Graph Theory, volume 173. Springer Verlag, New York, 2 edition, 2000. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Testing Subgraphs in Directed Graphs - Alon, Shapira (2003) (2 citations) (Correct)
Towards Device Driver Synthesis - Lehmann (2002) (Correct)
Hadwiger Number and the Cartesian Product Operation on Graphs - Master Of Science (Correct)
Consecutive ones Block for Symmetric Matrices Rui Wang.. - Department Of Computer (2003) (Correct)
A Model of Component Consistency in Distributed Diagnosis - Su, Wonham (Correct)
On Network Design Problems: Fixed Cost Flows and the.. - Even, Kortsarz, Slany (2001) (Correct)
Efficient Key Agreement for Ad-hoc Networks - Hietalahti (2001) (Correct)
Decomposing Infinite 2-Connected Graphs Into 3-Connected Components - Richter (2004) (Correct)
Embedding k-Outerplanar Graphs into l1 - Chekuri, Gupta, Newman.. (Correct)
Decomposing Infinite 2-Connected Graphs Into - Connected Components Bruce (Correct)
The Rank of a Cograph - Gordon Royle Department (Correct)
Consecutive ones Block for Symmetric Matrices - Wang, Lau (2003) (Correct)
The Rank of a Cograph - Gordon Royle Department (Correct)
Date: December 7, 2000 - There Are Two Self-citation (Wilhelm) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC