Graph theory
From MaRDI portal
Publication:3577833
zbMATH Open1204.05001MaRDI QIDQ3577833FDOQ3577833
Authors: Reinhard Diestel 
Publication date: 26 July 2010
Recommendations
graphsmatchingcolouringextremal graph theoryplanar graphsrandom graphsinfinite graphflowswell quasi ordercovering connectivity
Graph theory (including graph drawing) in computer science (68R10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)
Cited In (only showing first 100 items - show all)
- 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
- A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks
- On the Cucker-Smale flocking with alternating leaders
- Minimum degree conditions for vertex-disjoint even cycles in large graphs
- Forbidden pairs and the existence of a dominating cycle
- Topics in structural graph theory
- Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs
- Autonomous scale control of multiagent formations with only shape constraints
- Graph Factors and Matching Extensions
- Chromatic symmetric function of graphs from Borcherds algebras
- Game connectivity of graphs
- SPN graphs: when copositive = SPN
- Existence and stability of a screw dislocation under anti-plane deformation
- Title not available (Why is that?)
- Poset limits can be totally ordered
- 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
- Decomposing highly edge-connected graphs into paths of any given length
- Pósa's conjecture for graphs of order at least 2 × 108
- Rooted-tree network for optimal non-local gate implementation
- Topological cycle matroids of infinite graphs
- Matroid and Tutte-connectivity in infinite graphs
- Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph
- A tutorial on graph models for scheduling round‐robin sports tournaments
- 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
- A new proof of Seymour's 6-flow theorem
- Canonical tree-decompositions of a graph that display its \(k\)-blocks
- Preprocessing subgraph and minor problems: when does a small vertex cover help?
- Locally finite graphs with ends: A topological approach. II: Applications
- Detecting induced minors in AT-free graphs
- NP-completeness results for partitioning a graph into total dominating sets
- Metalogical decorations of logical diagrams
- 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
- The existence of semi-colorings in a graph
- Explicit linear kernels for packing problems
- Distributed minimum dominating set approximations in restricted families of graphs
- Number of cliques in graphs with a forbidden subdivision
- Embeddability between right-angled Artin groups..
- Decomposing highly connected graphs into paths of length five
- Universal \(H\)-colourable graphs
- An excluded minors method for infinite matroids
- 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
- Computing the metric dimension for chain graphs
- The circumference of the square of a connected graph
- Matrices attaining the minimum semidefinite rank of a chordal graph
- Decompositions of triangle-free 5-regular graphs into paths of length five
- Decomposing regular graphs with prescribed girth into paths of given length
- Graphs with two trivial critical ideals
- Isomorphisms of \(AC(\sigma)\) spaces for linear graphs
- The Complexity of Homomorphism Indistinguishability
- Connected searching of weighted trees
- Subclass graph embedding and a marginal Fisher analysis paradigm
- Flows on flow-admissible signed graphs
- Using basis dependence distance vectors to calculate the transitive closure of dependence relations by means of the Floyd-Warshall algorithm
- Bounding connected tree-width
- On the most imbalanced orientation of a graph
- On the most imbalanced orientation of a graph
- Problems on matchings and independent sets of a graph
- On the cycle space of a random graph
- Splitting planar graphs of girth 6 into two linear forests with short paths
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
- Towards the Hanani-Tutte theorem for clustered graphs
- The matching extendability of optimal 1-planar graphs
- On minimum average stretch spanning trees in polygonal 2-trees
- Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs
- On extendability of Deza graphs with diameter 2
- \(d\)-orthogonal analogs of classical orthogonal polynomials
- Excluding a large theta graph
- Skew-zigzag algebras
- Cyclically five-connected cubic graphs
- Locally finite graphs with ends: A topological approach. I: Basic theory
- A robber locating strategy for trees
- On the extendability of quasi-strongly regular graphs with diameter 2
- Approximating maximum agreement forest on multiple binary trees
- Nonempty intersection of longest paths in series-parallel graphs
- Network connectivity assessment and improvement through relay node deployment
- Hamiltonicity of 3-arc graphs
- Entropy-driven phase transition in low-temperature antiferromagnetic Potts models
- Linear time parameterized algorithms for subset feedback vertex set
- Partitions of graphs into small and large sets
- Environmental evolutionary graph theory
- Twins in Subdivision Drawings of Hypergraphs
- Dual parameterization of weighted coloring
This page was built for publication: Graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3577833)
