scientific article; zbMATH DE number 5032352

MaRDI QIDQ5472076zbMATH OpenFDO

Authors Reinhard Diestel

Publication date 14 June 2006

zbMATH Keywords

bipartite graphscolouringconnectivityEulerian graphsextemal graph theoryflowsgraphsHamiltonian cyclesmatchings and coveringsminors and well-quasi-orderingpaths and cyclesplanar graphsRamsey theoryrandom graphstrees

Mathematics Subject Classification ID

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

Cited in

(30)

• Negative (and positive) circles in signed graphs: a problem collection
• Note on the perfect EIC-graphs
• Some sharp results on the generalized Turán numbers
• Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem
• The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms
• Comparison and extremal results on three eccentricity-based invariants of graphs
• Euler's Königsberg: the explanatory power of mathematics
• On the parameterized complexity of separating certain sources from the target
• Matching preclusion for cube-connected cycles
• Resistance characterizations of equiarboreal graphs
• From tree-decompositions to clique-width terms
• Handbook of graph theory
• Stratified sampling for the Ising model: A graph-theoretic approach
• Coupon coloring of some special graphs
• The PSurface library
• Bounding the feedback vertex number of digraphs in terms of vertex degrees
• Kernelization of arc disjoint cycle packing in -bounded digraphs
• Correlation clustering and two-edge-connected augmentation for planar graphs
• Packing arc-disjoint cycles in oriented graphs
• A tight bound for the number of edges of matchstick graphs
• Variants of the Gyárfás-Sumner conjecture: oriented trees and rainbow paths
• Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs
• An upper bound for a Ramsey type problem for k-connected subgraphs
• Connected subgraphs, matching, and partitions
• On counting and constructing all admissible orders of the non-empty intervals in any finite chain
• Arborescences and shortest path trees when colors matter
• Listing maximal H-free subgraphs
• An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems
• Parameterized complexity of dominating set variants in almost cluster and split graphs
• Knowledge problems in protocol analysis: extending the notion of subterm convergent

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5472076)