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)
- Canonical tree-decompositions of finite graphs. II. Essential parts
- Odd \(K_{3,3}\) subdivisions in bipartite graphs
- Unavoidable induced subgraphs in large graphs with no homogeneous sets
- Connectivity and tree structure in finite graphs
- Average degree conditions forcing a minor
- A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs
- Strong cliques and equistability of EPT graphs
- Parameterized algorithms for finding square roots
- On finding rainbow and colorful paths
- STRONG KOSZULNESS OF TORIC RINGS ASSOCIATED WITH STABLE SET POLYTOPES OF TRIVIALLY PERFECT GRAPHS
- On the number of minimal separators in graphs
- Axioms for infinite matroids
- Forcing a sparse minor
- Dismantlability of weakly systolic complexes and applications
- Unavoidable vertex-minors in large prime graphs
- Enumeration of balanced finite group valued functions on directed graphs
- SPN completable 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
- Extending cycles locally to Hamilton cycles
- Extremal results for random discrete structures
- Groups of balanced labelings on graphs
- Courcelle's theorem -- a game-theoretic approach
- Canonical tree-decompositions of finite graphs. I: Existence and algorithms.
- On the reversal bias of the minimax social choice correspondence
- Dynamic coloring of graphs having no \(K_5\) minor
- Computing Roman domatic number of graphs
- A simple existence criterion for normal spanning trees
- Gromov hyperbolic cubic graphs
- Phase transition on the degree sequence of a random graph process with vertex copying and deletion
- Title not available (Why is that?)
- Network decontamination with a single agent
- A note on total and list edge-colouring of graphs of tree-width 3
- Note on semi-linkage with almost prescribed lengths in large graphs
- Finitary and cofinitary gammoids
- Kernelization using structural parameters on sparse graph classes
- Matroids with an infinite circuit-cocircuit intersection
- Note on Enomoto and Ota's conjecture for short paths in large graphs
- 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
- Unique factorization of tensor products for Kac-Moody algebras
- Graphs \& digraphs
- Handbook of product graphs
- Graph theory
- Enomoto and Ota's conjecture holds for large graphs
- Infinite gammoids: minors and duality
- Boundary graph classes for some maximum induced subgraph problems
- Copula based hierarchical risk aggregation through sample reordering
- Coverings of cubic graphs and 3-edge colorability
- Regularity 3 in edge ideals associated to bipartite graphs
- Infinite matroids in graphs
- Some local-global phenomena in locally finite graphs
- Information diffusion on the iterated local transitivity model of online social networks
- Extremal infinite graph theory
- Second-order and local characteristics of network intensity functions
- Community structure inspired algorithms for SAT and \#SAT
- To approximate treewidth, use treelength!
- Exact and asymptotic results on coarse Ricci curvature of graphs
- Infinite gammoids
- A refined complexity analysis of degree anonymization in graphs
- Tuza's conjecture for graphs with maximum average degree less than 7
- Sparse stable systems
- Graph theory
- Graph theory
- Matroid Theory for Algebraic Geometers
- List edge-coloring and total coloring in graphs of low treewidth
- Improved bounds for hypo-Hamiltonian graphs
- On the organization of round robin tournaments with constraints
- ALGEBRAIC STRUCTURES RELATED TO BALANCED FUNCTIONS ON GRAPHS: RESULTS AND OPEN PROBLEMS
- A different short proof of Brooks' theorem
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Random graphs from a weighted minor-closed class
- Robust synchronization of a class of chaotic networks
- Forbidden subgraphs and the existence of a 2-walk
- Finding clubs in graph classes
- Algorithms and topology of Cayley graphs for groups.
- Bounds on connective constants of regular graphs
- Short certificates for chromatic equivalence
- Nordhaus-Gaddum for treewidth
- The structure of 2-separations of infinite matroids
- Treewidth computations. II. Lower bounds
- On the balanced decomposition number
- Bounds for distinguishing invariants of infinite graphs
- Kotzig frames and circuit double covers
- Linkless and flat embeddings in 3-space
- Constant thresholds can make target set selection tractable
- Nowhere-zero flows on tensor products of signed graphs
- Flows, currents, and cycles for Markov chains: large deviation asymptotics
- On the complexity of the identifiable subgraph problem, revisited
- Edge contractions in subclasses of chordal graphs
- Bicolored independent sets and bicliques
- The Erdős-Pósa property for clique minors in highly connected graphs
- On robust clusters of minimum cardinality in networks
- On the excluded minor structure theorem for graphs of large tree-width
- On degree sums of a triangle-free graph
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)
