scientific article

Publication date: 26 July 2010

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

matching colouring random graphs planar graphs graphs flows infinite graph extremal graph theory well quasi order covering connectivity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)

Related Items (only showing first 100 items - show all)

On finding rainbow and colorful paths ⋮ SPN completable graphs ⋮ Enumeration of balanced finite group valued functions on directed graphs ⋮ On computational complexity of graph inference from counting ⋮ Cospectral digraphs from locally line digraphs ⋮ On the maximum order of graphs embedded in surfaces ⋮ Distance magic Cartesian products of graphs ⋮ The quest for a characterization of hom-properties of finite character ⋮ Matroid intersection, base packing and base covering for infinite matroids ⋮ On the reversal bias of the minimax social choice correspondence ⋮ Dynamic coloring of graphs having no \(K_5\) minor ⋮ Extending cycles locally to Hamilton cycles ⋮ Computing Roman domatic number of graphs ⋮ A simple existence criterion for normal spanning trees ⋮ Structural parameterizations for boxicity ⋮ Network decontamination with a single agent ⋮ Note on semi-linkage with almost prescribed lengths in large graphs ⋮ A note on total and list edge-colouring of graphs of tree-width 3 ⋮ Finitary and cofinitary gammoids ⋮ Posets with cover graph of pathwidth two have bounded dimension ⋮ Reduction rules for the maximum parsimony distance on phylogenetic trees ⋮ Using a new zero forcing process to guarantee the strong Arnold property ⋮ SPN graphs: when copositive = SPN ⋮ A stronger bound for the strong chromatic index (extended abstract) ⋮ Path decompositions of regular graphs with prescribed girth ⋮ Pure Nash equilibria of competitive diffusion process on toroidal grid graphs ⋮ The tournament scheduling problem with absences ⋮ Decompositions of highly connected graphs into paths of any given length ⋮ Decompositions of highly connected graphs into paths of length five ⋮ The union-closed sets conjecture almost holds for almost all random bipartite graphs ⋮ Rooted-tree network for optimal non-local gate implementation ⋮ Topological cycle matroids of infinite graphs ⋮ Kernelization using structural parameters on sparse graph classes ⋮ A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem ⋮ Ends of semigroups ⋮ Dominating cycles and forbidden pairs containing \(P_5\) ⋮ Characterizing width two for variants of treewidth ⋮ Algorithmic aspects of open neighborhood location-domination in graphs ⋮ Controllability of the multi-agent system modeled by the threshold graph with one repeated degree ⋮ Canonical tree-decompositions of a graph that display its \(k\)-blocks ⋮ A new proof of Seymour's 6-flow theorem ⋮ Decomposing highly edge-connected graphs into paths of any given length ⋮ Metalogical decorations of logical diagrams ⋮ Extremal results for random discrete structures ⋮ Solving the canonical representation and star system problems for proper circular-arc graphs in logspace ⋮ Upper bounds on the paired domination subdivision number of a graph ⋮ Distributed minimum dominating set approximations in restricted families of graphs ⋮ Universal \(H\)-colourable graphs ⋮ Dangerous reference graphs and semantic paradoxes ⋮ Graph and heuristic based topology optimization of crash loaded structures ⋮ A short proof of the versatile version of Fleischner's theorem ⋮ The property of \(k\)-colourable graphs is uniquely decomposable ⋮ Preprocessing subgraph and minor problems: when does a small vertex cover help? ⋮ Matrices attaining the minimum semidefinite rank of a chordal graph ⋮ Axioms for infinite matroids ⋮ Detecting induced minors in AT-free graphs ⋮ Kernel bounds for path and cycle problems ⋮ The complexity of rerouting shortest paths ⋮ Two short proofs of the bounded case of S. B. Rao's degree sequence conjecture ⋮ Trees of nuclei and bounds on the number of triangulations of the 3-ball ⋮ Groups of balanced labelings on graphs ⋮ Random graphs from a weighted minor-closed class ⋮ Connectivity and tree structure in finite graphs ⋮ Robust synchronization of a class of chaotic networks ⋮ Existence and stability of a screw dislocation under anti-plane deformation ⋮ Forbidden subgraphs and the existence of a 2-walk ⋮ Finding clubs in graph classes ⋮ Matroids with an infinite circuit-cocircuit intersection ⋮ Algorithms and topology of Cayley graphs for groups. ⋮ Matroid and Tutte-connectivity in infinite graphs ⋮ Courcelle's theorem -- a game-theoretic approach ⋮ The Erdős-Pósa property for clique minors in highly connected graphs ⋮ Nordhaus-Gaddum for treewidth ⋮ A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks ⋮ Linkless and flat embeddings in 3-space ⋮ Edge contractions in subclasses of chordal graphs ⋮ Gromov hyperbolic cubic graphs ⋮ Bicolored independent sets and bicliques ⋮ On degree sums of a triangle-free graph ⋮ Exact and asymptotic results on coarse Ricci curvature of graphs ⋮ An abstraction of Whitney's broken circuit theorem ⋮ The connectivity of domination dot-critical graphs with no critical vertices ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ The complexity of the empire colouring problem ⋮ Computing the blocks of a quasi-median graph ⋮ Joins of 1-planar graphs ⋮ A fractional Helly theorem for boxes ⋮ Complete monotonicity for inverse powers of some combinatorially defined polynomials ⋮ The circumference of the square of a connected graph ⋮ Chromatic number and complete graph substructures for degree sequences ⋮ A graded Bayesian coherence notion ⋮ Note on Enomoto and Ota's conjecture for short paths in large graphs ⋮ Second-order and local characteristics of network intensity functions ⋮ Unavoidable induced subgraphs in large graphs with no homogeneous sets ⋮ Odd \(K_{3,3}\) subdivisions in bipartite graphs ⋮ Canonical tree-decompositions of finite graphs. II. Essential parts ⋮ Average degree conditions forcing a minor ⋮ Strong cliques and equistability of EPT graphs ⋮ A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs ⋮ Parameterized algorithms for finding square roots

This page was built for publication: