scientific article; zbMATH DE number 5032352
From MaRDI portal
Publication:5472076
zbMath1093.05001MaRDI QIDQ5472076
Publication date: 14 June 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
colouringrandom graphsplanar graphsRamsey theorygraphsconnectivityflowsbipartite graphsHamiltonian cyclesEulerian graphstreespaths and cyclesextemal graph theorymatchings and coveringsminors and well-quasi-ordering
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)
Related Items (19)
Stratified sampling for the Ising model: A graph-theoretic approach ⋮ Negative (and positive) circles in signed graphs: a problem collection ⋮ Resistance characterizations of equiarboreal graphs ⋮ Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem ⋮ From tree-decompositions to clique-width terms ⋮ Kernelization of arc disjoint cycle packing in \(\alpha\)-bounded digraphs ⋮ Correlation clustering and two-edge-connected augmentation for planar graphs ⋮ Packing arc-disjoint cycles in oriented graphs ⋮ Note on the perfect EIC-graphs ⋮ Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs ⋮ Coupon coloring of some special graphs ⋮ The PSurface library ⋮ Bounding the feedback vertex number of digraphs in terms of vertex degrees ⋮ Some sharp results on the generalized Turán numbers ⋮ 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
This page was built for publication:
