Handbook of Graph Theory
From MaRDI portal
Publication:4435150
DOI10.1201/9780203490204zbMATH Open1036.05001OpenAlexW4214880424MaRDI QIDQ4435150FDOQ4435150
Authors:
Publication date: 26 November 2003
Full work available at URL: https://doi.org/10.1201/9780203490204
Recommendations
directed graphscoloringsalgebraic graph theorygraph representationstopological graph theoryhistory of graph theoryanalytic graph theoryconnectivity and traversabilitygraphical measurementgraphs in computer sciencenetworks and flows
Graph theory (05Cxx) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to combinatorics (05-00)
Cited In (only showing first 100 items - show all)
- On Hamilton cycle decompositions of \(r\)-uniform \(r\)-partite hypergraphs
- Positive zero forcing and edge clique coverings
- Integrality of Gopakumar-Vafa invariants of toric Calabi-Yau threefolds
- On unretractive graphs
- Pole structure of topological string free energy
- Variational integrators for electric circuits
- On minimal Sturmian partial words
- Subclass graph embedding and a marginal Fisher analysis paradigm
- On the zero-divisor graphs of finite free semilattices
- Handbook of graph theory
- On existence of reporter strands in DNA-based graph structures
- On optimal completion of incomplete pairwise comparison matrices
- All normalized anti-monotonic overlap graph measures are bounded
- Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds
- On graphs associated to sets of rankings
- Adjacency preservers on invertible Hermitian matrices. I.
- Some properties on the tensor product of graphs obtained by monogenic semigroups
- A new bound of radius with irregularity index
- Median eigenvalues of bipartite graphs
- Protean graphs with a variety of ranking schemes
- Graphs associated with vector spaces of even dimension: A link with differential geometry
- Crack STIT tessellations: characterization of stationary random tessellations stable with respect to iteration
- Voting procedures, complexity of
- Investigating the \(b\)-chromatic number of bipartite graphs by using the bicomplement
- The minimum semidefinite rank of a triangle-free graph
- Restricted arc-connectivity of generalized \(p\)-cycles
- Oriented chromatic number of grids is greater than 7
- On spanning cycles, paths and trees
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
- \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs
- Heuristics for deciding collectively rational consumption behavior
- Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \)
- A textbook of graph theory
- Graph orientation to maximize the minimum weighted outdegree
- A lower bound for the vertex boundary-width of complete \(k\)-ary trees
- Time constrained graph searching
- Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface
- On the runtime and robustness of randomized broadcasting
- Old and new results on algebraic connectivity of graphs
- 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
- Toward model-based control of non-linear hydraulic networks
- Some properties on the disjunctive product over graphs of monogenic semigroups
- On the corona product of monogenic semigroup graphs
- A supernodal formulation of vertex colouring with applications in course timetabling
- A branch-and-bound algorithm for the acyclic partitioning problem
- Finding similar/diverse solutions in answer set programming
- Efficient edge domination in regular graphs
- Title not available (Why is that?)
- Analytical relationships between metric and centrality measures of a network and its dual
- On the dot product of graphs over monogenic semigroups
- Selective hypergraph colourings
- A continuous analog for 4-dimensional objects
- Nonnegatively curved 5-manifolds with almost maximal symmetry rank
- On wreathed lexicographic products of graphs
- A census of genus-two 3-manifolds up to 42 coloured tetrahedra
- The number of excellent discrete Morse functions on graphs
- An edge deletion model for complex networks
- Measurable chromatic and independence numbers for ergodic graphs and group actions
- 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
- Graph operations and neighbor rupture degree
- Hashing and canonicalizing Notation 3 graphs
- Oriented matroids and complete-graph embeddings on surfaces
- Genus of a graph and its strong preservers
- Relation-algebraic specification and solution of special university timetabling problems
- Capacitated arc routing problem with deadheading demands
- Extending the doubly linked face list for the representation of 2-pseudomanifolds and 2-manifolds with boundaries
- Graph classes and the switch Markov chain for matchings
- The graph based on Gröbner-Shirshov bases of groups
- Semi square stable graphs and efficient dominating sets
- Counting minimal semi-Sturmian words
- Sharp lower and upper bounds for the Gaussian rank of a graph
- The achromatic colouring of graphs
- Quantum algorithm for lexicographically minimal string rotation
- Counter machines and crystallographic structures
- A Python hands-on tutorial on network and topological neuroscience
- Bounds on the spectral radius of digraphs from subgraph counts
- Characterization of perfect matching transitive graphs
- Drawing Big Graphs Using Spectral Sparsification
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
- Target control and expandable target control of complex networks
- Time discretizations of Wasserstein-Hamiltonian flows
- Bosonization based on Clifford algebras and its gauge theoretic interpretation
- On achromatic number of central graph of some graphs
- An efficient and robust design optimisation of multi-state flow network for multiple commodities using generalised reliability evaluation algorithm and edge reduction method
- On some properties of the Laplacian matrix revealed by the RCM algorithm.
- Equitable distinguishing chromatic number
- Line graphs of monogenic semigroup graphs
- Some indices over a new algebraic graph
- The sigma coindex of graph operations
- Analysis of some topological indices over the weakly zero-divisor graph of the ring \(\mathbb{Z}_p \times \mathbb{Z}_q \times \mathbb{Z}_r\)
- Some properties of zero divisor graph obtained by the ring \(Z_p \times Z_q \times Z_r\)
- Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs
- Compressed cliques graphs, clique coverings and positive zero forcing
- 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}$
- Title not available (Why is that?)
- SOME GRAPH PARAMETERS OF POWER SET GRAPHS
This page was built for publication: Handbook of Graph Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4435150)
