Graph theory. An introductory course
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 45992
- scientific article; zbMATH DE number 3861163
- scientific article; zbMATH DE number 2200042
- scientific article; zbMATH DE number 5575317
- scientific article; zbMATH DE number 2141600
- scientific article; zbMATH DE number 854567
- scientific article; zbMATH DE number 1118889
- Graph theory. An introduction to proofs, algorithms, and applications
Cited in
(only showing first 100 items - show all)- Almost all regular graphs are Hamiltonian
- On the problem of finding small subdivision and homomorphism bases for classes of countable graphs
- Construction techniques for some thin sets in duals of compact abelian groups
- The binding number of a graph and its circuits
- Note on induced subgraphs of the unit distance graph \(E^ n\)
- Generalized handles in graphs and connected sums of manifolds
- An NC algorithm for Brooks' theorem
- An algorithm for generating all maximal independent subsets of posets
- Hadwiger's conjecture is true for almost every graph
- Sorting in one round
- The embedding of partial triple systems when 4 divides \(\lambda\)
- Graphs without large triangle free subgraphs
- Cycles and spanning trees
- Size and connectivity of the \(k\)-core of a random graph
- Infinitary logics and 0-1 laws
- Symmetric pants decompositions of Riemann surfaces
- Optimal parallel algorithms for finding cut vertices and bridges of interval graphs
- On the n-cutset property
- Tilings and discrete Dirichlet problems
- On the spectra of certain graphs arising from finite fields
- On the parallel dynamics of the \(Q\)-state Potts and \(Q\)-Ising neural networks
- The combinatorics of effective resistances and resistive inverses
- The zero-divisor graph of a commutative ring
- Codimension-one foliations and oriented graphs
- Critical probabilities for site and bond percolation models
- Schubert graphs, symmetric groups and flags of Boolean lattices
- The automorphism group of a structural matrix algebra
- Recent developments in total colouring
- One-way cellular automata on Cayley graphs
- Cayley, Marty and Schreier hypergraphs
- Hyperedge channels are abelian
- Edge search in hypergraphs
- K-groups associated with substitution minimal systems
- Euler cycles in the complete graph \(K_{2m+1}\)
- The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices
- The complexity of the evaluation of complex algebra expressions
- The permutation-path coloring problem on trees.
- A Nim game played on graphs.
- Remarks on the computation of the horizon of a digital terrain
- Finding 2-edge connected spanning subgraphs.
- Planar quorums
- The oriented cycle game
- Characterization of pure strategy equilibria infinite anonymous games
- Pregeometric concepts on graphs and cellular networks as possible models of space-time at the Planck-scale
- The anti-adjacency matrix of a graph: eccentricity matrix
- Reconstruction methods for networks: the case of economic and financial systems
- The generalized total graph of a commutative semiring
- Positive equilibria of a class of power-law kinetics
- On the ABC index of connected graphs with given degree sequences
- A variable neighborhood MOEA/D for multiobjective test task scheduling problem
- Characterization of consistent completion of reciprocal comparison matrices
- Finite rings with complete bipartite zero-divisor graphs.
- Matrix method for linear sequential dynamical systems on digraphs
- Edge search in graphs and hypergraphs of bounded rank
- Growth profile and invariant measures for the weakly supercritical contact process on a homogeneous tree
- Triangulations intersect nicely
- The computational difficulty of manipulating an election
- Counting bridgeless graphs
- A threshold for perfect matchings in random d-pure hypergraphs
- Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem
- Almost-spanning subgraphs with bounded degree in dense graphs
- The connectivity of a graph on uniform points on [0,\,1]\(^{d}\).
- Discrete dynamical systems on graphs and Boolean functions
- Every tree contains a large induced subgraph with all degrees odd
- The reversing number of a digraph
- A new approach to solving three combinatorial enumeration problems on planar graphs
- Stability of random matrix models
- Random walks and orthogonal functions associated with highly symmetric graphs
- Extremal theory for convex matchings in convex geometric graphs
- Compensations in small divisor problems
- On the minimum number of logical clauses inferred from examples
- Matrix scaling for large-scale system decomposition
- Stable matchings and linear programming
- The existence of \((2 \times c, \lambda )\) grid-block designs with \({c\in \{3, 4, 5\}}\) and \(\lambda \geq 1\)
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Jacobian tori associated with a finite graph and its abelian covering graphs
- Existence and continuity of the flow constant in first passage percolation
- Ramsey numbers of partial order graphs (comparability graphs) and implications in ring theory
- Precise asymptotics of some meeting times arising from the voter model on large random regular graphs
- The maximal flow from a compact convex subset to infinity in first passage percolation on \(\mathbb{Z}^d \)
- Size of a minimal cutset in supercritical first passage percolation
- Non-permutability graph of subgroups
- Domains and stochastic processes
- The linear \((n - 1)\)-arboricity of some lexicographic product graphs
- The probabilistic approach to limited packings in graphs
- A fast algorithm for the construction of universal footprinting templates in DNA
- Network formation and stable equilibrium
- Optimal per-edge processing times in the semi-streaming model
- A note on robustness of D-optimal block designs for two-colour microarray experiments
- Counting spanning trees using modular decomposition
- Maximal stream and minimal cutset for first passage percolation through a domain of \(\mathbb{R}^{d}\)
- The decomposition of \(K_v\) into \(K_2\times K_5\)'s
- Steiner diagrams and \(k\)-star hubs
- On enumerating minimal dicuts and strongly connected subgraphs
- Synchronization in random networks with given expected degree sequences
- Independent sets in triangle-free cubic planar graphs
- On finite rings in which zero-divisor graphs satisfy the Dirac's condition.
- The replicator equation in stochastic spatial evolutionary games
- Tree embeddings
- Wiener index on lines of unit cells of the body-centered cubic grid
This page was built for publication: Graph theory. An introductory course
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4198785)