Handbook of Graph Theory

DOI10.1201/9780203490204zbMath1036.05001OpenAlexW4214880424MaRDI QIDQ4435150

No author found.

Publication date: 26 November 2003

Full work available at URL: https://doi.org/10.1201/9780203490204

directed graphs colorings algebraic graph theory graph representations topological graph theory history of graph theory analytic graph theory connectivity and traversability graphical measurement graphs in computer science networks and flows

Mathematics Subject Classification ID

Graph theory (05Cxx) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to combinatorics (05-00)

Related Items

Stability for coupled systems on networks with Caputo-Hadamard fractional derivative, Finding similar/diverse solutions in answer set programming, Time discretizations of Wasserstein–Hamiltonian flows, SOME GRAPH PARAMETERS OF POWER SET GRAPHS, On achromatic number of central graph of some graphs, Isabelle formalisation of original representation theorems, Distributed delay-tolerant strategies for equality-constraint sum-preserving resource allocation, Quantum algorithm for lexicographically minimal string rotation, Bounds on the Spectral Radius of Digraphs from Subgraph Counts, Geometric modal logic, Zero-divisor super-$\lambda$ graphs, PROPERTIES OF ZERO-DIVISOR GRAPH OF THE RING $\mathbf{F}_{p^l} \times \mathbf{F}_{q^m} \times \mathbf{F}_{r^n}$, Genus of a graph and its strong preservers, Voting Procedures, Complexity of, Coordinated road-network search route planning by a team of UAVs, On unretractive graphs, Graph classes and the switch Markov chain for matchings, Unnamed Item, Crack STIT tessellations: characterization of stationary random tessellations stable with respect to iteration, Rigorous continuum limit for the discrete network formation problem, Some properties of zero divisor graph obtained by the ring Zp × Zq × Zr, Unnamed Item, Adjacency preservers on invertible Hermitian matrices. I., Some family of distance pattern distinguishing graphs and realization results, Some properties on the tensor product of graphs obtained by monogenic semigroups, New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings, EXTENDING THE DOUBLY LINKED FACE LIST FOR THE REPRESENTATION OF 2-PSEUDOMANIFOLDS AND 2-MANIFOLDS WITH BOUNDARIES, On the runtime and robustness of randomized broadcasting, Perfect matching transitivity of circulant graphs., Compressed cliques graphs, clique coverings and positive zero forcing, Equitable distinguishing chromatic number, A branch-and-bound algorithm for the acyclic partitioning problem, Oriented matroids and complete-graph embeddings on surfaces, Observing the State of a Smart Grid Using Bilevel Programming, A continuous analog for 4-dimensional objects, Perfect matching and Hamilton cycle decomposition of complete balanced $( k + 1 )$-partite $k$-uniform hypergraphs, The number of shortest paths in the (n, k)-star graph, Graph operations and neighbor rupture degree, Bosonization based on Clifford algebras and its gauge theoretic interpretation, Subclass graph embedding and a marginal Fisher analysis paradigm, A new bound of radius with irregularity index, Old and new results on algebraic connectivity of graphs, Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface, Relation-algebraic specification and solution of special university timetabling problems, Target control and expandable target control of complex networks, A supernodal formulation of vertex colouring with applications in course timetabling, Computing generalized de Bruijn sequences, On optimal completion of incomplete pairwise comparison matrices, On Hamilton cycle decompositions of $r$-uniform $r$-partite hypergraphs, Periods in partial words: an algorithm, Variational integrators for electric circuits, All normalized anti-monotonic overlap graph measures are bounded, On the dot product of graphs over monogenic semigroups, Oriented chromatic number of grids is greater than 7, Graphs associated with vector spaces of even dimension: A link with differential geometry, A lower bound for the vertex boundary-width of complete $k$-ary trees, Analytical relationships between metric and centrality measures of a network and its dual, Measurable chromatic and independence numbers for ergodic graphs and group actions, The minimum semidefinite rank of a triangle-free graph, Restricted arc-connectivity of generalized $p$-cycles, Semi Square Stable Graphs and Efficient Dominating Sets, Selective hypergraph colourings, Investigating the $b$-chromatic number of bipartite graphs by using the bicomplement, A Markov chain on the solution space of edge colorings of bipartite graphs, Toward model-based control of non-linear hydraulic networks, The number of excellent discrete Morse functions on graphs, The graph based on Gröbner-Shirshov bases of groups, On spanning cycles, paths and trees, Counting minimal semi-Sturmian words, Drawing Big Graphs Using Spectral Sparsification, Time constrained graph searching, A variant of the isoperimetric method of Hamidoune, applied to Kneser's theorem, On system state equipartitioning and semistability in network dynamical systems with arbitrary time-delays, Positive Zero Forcing and Edge Clique Coverings, GRAPH ORIENTATION TO MAXIMIZE THE MINIMUM WEIGHTED OUTDEGREE, On the zero-divisor graphs of finite free semilattices, On graphs associated to sets of rankings, $(r,r+1)$-factorizations of $(d,d+1)$-graphs, Integrality of Gopakumar-Vafa invariants of toric Calabi-Yau threefolds, Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs, Degree-bounded factorizations of bipartite multigraphs and of pseudographs, On minimal Sturmian partial words, Counter machines and crystallographic structures, Capacitated arc routing problem with deadheading demands, On wreathed lexicographic products of graphs, Some results on Reed's conjecture about $\omega ,\Delta $, and $\chi $ with respect to $\alpha $, A census of genus-two 3-manifolds up to 42 coloured tetrahedra, Pole structure of topological string free energy, Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree, Heuristics for deciding collectively rational consumption behavior, An edge deletion model for complex networks, Hashing and canonicalizing Notation 3 graphs, An efficient and robust design optimisation of multi-state flow network for multiple commodities using generalised reliability evaluation algorithm and edge reduction method, Nonnegatively curved 5-manifolds with almost maximal symmetry rank, Some indices over a new algebraic graph, Line graphs of monogenic semigroup graphs, The sigma coindex of graph operations, Graphs as navigational infrastructure for high dimensional data spaces, Eulerian tour algorithms for data visualization and the ${{\mathtt PairViz}}$ package, Efficient edge domination in regular graphs, On existence of reporter strands in DNA-based graph structures, SOME PROPERTIES ON THE DISJUNCTIVE PRODUCT OVER GRAPHS OF MONOGENIC SEMIGROUPS, ON THE CORONA PRODUCT OF MONOGENIC SEMIGROUP GRAPHS, REWRITING LOGIC-BASED SEMANTICS OF P SYSTEMS AND THE MAXIMAL CONCURRENCY, Certain chromatic sums of some cycle-related graph classes, Toward a classification of isodynamic feed-forward motifs, From rankings’ collinearity to counting SDR's via chromatic list expression, On some properties of the Laplacian matrix revealed by the RCM algorithm, Perfect matching dominating cycle — a new dominating cycle, Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection, NONTESTABILITY OF EQUAL WEIGHTS SPATIAL DEPENDENCE, On Harmonious Colouring of and, Generalization of Achromatic Colouring of Central Graphs, The Achromatic Colouring Of Graphs, Protean graphs with a variety of ranking schemes, Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds, Characterization of perfect matching transitive graphs, On the X-rays of permutations, Median eigenvalues of bipartite graphs, Sharp lower and upper bounds for the Gaussian rank of a graph, Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs, A Python hands-on tutorial on network and topological neuroscience