scientific article; zbMATH DE number 945671

zbMath0859.05001MaRDI QIDQ4715442

Reinhard Diestel

Publication date: 14 November 1996

Full work available at URL: http://www.emis.de/monographs/Diestel/de/

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

pathstextbookcyclesrandom graphsregularity lemmaconnectivitybipartite graphsHamiltonian cyclesEulerian graphsplanarityRamsey numberstreesmatchingscoveringsperfect graphsprobabilistic methodminorswell-quasi-orderingcoloringsRamsey's theoremHadwiger conjecturecolorsKruskal's theoremplane graphsspanning treesTutte's flow conjecturesKuratowski's theoremtheorem of Madertheorem of Menger

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)

Related Items (15)

Hypohamiltonian snarks have a 5-flow ⋮ Farrell polynomials on graphs of bounded tree width ⋮ A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth ⋮ On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity ⋮ On the simple representations of generalized quantum groups and quantum doubles ⋮ Highly connected subgraphs of graphs with given independence number ⋮ Highly connected subgraphs of graphs with given independence number (extended abstract) ⋮ Distributed output feedback control of decomposable LPV systems with delay and switching topology: application to consensus problem in multi-agent systems ⋮ Disjoint \(K_{r}\)-minors in large graphs with given average degree ⋮ The Number of Plane Diagrams of a Lattice ⋮ Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density ⋮ On parameterized exponential time complexity ⋮ Computational Classification of Tubular Algebras ⋮ Complexity of choosing subsets from color sets ⋮ Parameters of connectivity in ()-linear graphs

This page was built for publication: