scientific article; zbMATH DE number 854567
From MaRDI portal
Publication:4869540
Recommendations
Cited in
(only showing first 100 items - show all)- Parameters of connectivity in ()-linear graphs
- On the structure of Hamiltonian cycles in Cayley graphs of finite quotients of the modular group
- Induced-universal graphs for graphs with bounded maximum degree
- Fast-mixed searching and related problems on graphs
- A new result on the problem of Buratti, Horak and Rosa
- On Injective Colourings of Chordal Graphs
- Decision problem for shuffled genes
- Total induced vertex stress in barbell-like graphs
- Linear-size planar Manhattan network for convex point sets
- Global exponential stability for coupled retarded systems on networks: a graph-theoretic approach
- Bounds on the nullity, the \(H\)-rank and the Hermitian energy of a mixed graph
- Two results on the palette index of graphs
- Center of Cartesian and strong product of digraphs
- A characterization of two-dimensional Buchsbaum matching complexes
- The one-cop-moves game on graphs with some special structures
- Positive periodic solutions of coupled singular Rayleigh systems
- Stability number and f-factors in graphs
- Spectral properties of \(NC\)-graphs
- A graph-theoretic approach to boundedness of stochastic Cohen-Grossberg neural networks with Markovian switching
- Wiener index and addressing of the total graph
- LINKING IN STRAIGHT-EDGE EMBEDDINGS OF K7
- The parameterized complexity of the minimum shared edges problem
- Global dynamics of a multistage SIR model with distributed delays and nonlinear incidence rate
- Acyclic coloring of products of digraphs
- Brouwer type conjecture for the eigenvalues of distance signless Laplacian matrix of a graph
- Verifiable broadcasting and gossiping in communication networks
- The effect on Aα-eigenvalues of mixed graphs and unit gain graphs by adding edges in clusters
- On some total graphs on finite rings
- On graphs whose domination numbers equal their independent domination numbers
- Stability of multi-group models with cross-dispersal based on graph theory
- Long cycles in graphs without Hamiltonian paths
- Some properties of intersection graph of a module with an application of the graph of \(\mathbb{Z}_n\)
- On \((a, d)\)-SEAT labeling of forests of subdivided stars
- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs
- Topology of cut complexes of graphs
- Fractal networks: topology, dimension, and complexity
- Modular irregularity strength of graphs
- The upper domatic number of powers of graphs
- Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem
- Lattices, whose incomparability graphs have horns
- On the size of 3-uniform linear hypergraphs
- Dynamics of a multigroup SIQS epidemic model under regime switching
- Packing trees of unbounded degrees in random graphs
- A New Characterisation of Connected Hypergraphs
- Incomparability graphs of lattices
- Computational classification of tubular algebras
- Multi-switch: a tool for finding potential edge-disjoint 1-factors
- Stability of random impulsive coupled systems on networks with Markovian switching
- The largest graphs with given order and diameter: a simple proof
- Modelling and control of cholera on networks with a common water source
- Super restricted edge connectivity of regular edge-transitive graphs
- Graphs on all vertices and edges
- Global stability of coupled nonlinear systems with Markovian switching
- Relations between the inertia indices of a mixed graph and those of its underlying graph
- Embeddings of maximum packings in triple systems
- The optimal capture time of the one-cop-moves game
- Two-stage matching-and-scheduling algorithm for real-time private parking-sharing programs
- An algorithm for computing cutpoints in finite metric spaces
- Combinatorics on update digraphs in Boolean networks
- Fast edge searching and fast searching on graphs
- Linearly independent vertices and minimum semidefinite rank
- SUCCESSFUL ELEMENTARY GENE ASSEMBLY STRATEGIES
- Embedding a subclass of trees into hypercubes
- Input-to-state stability of multi-group stochastic coupled systems with time-varying delay
- On the induced matching problem
- Steiner tree problem with minimum number of Steiner points and bounded edge-length
- On connectivities of edge-colored graphs
- On the connectivity and equality of some graphs on finite semigroups
- On game chromatic vertex-critical graphs
- Flows of 3-edge-colorable cubic signed graphs
- scientific article; zbMATH DE number 3557814 (Why is no real title available?)
- scientific article; zbMATH DE number 3637904 (Why is no real title available?)
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms
- Minimal 2-point set dominating sets of a graph
- Coloring problems on bipartite graphs of small diameter
- Kirchhoff index and degree Kirchhoff index of complete multipartite graphs
- The maximum girth and minimum circumference of graphs with prescribed radius and diameter
- Scheduling to minimize gaps and power consumption
- Invertibility of graph translation and support of Laplacian Fiedler vectors
- Are induction and well-ordering equivalent?
- Commuting decomposition of \(K_{n_1,n_2,\dots,n_k}\) through realization of the product \(A(G)A\left(G^P_k\right)\)
- The strict-sense nonblocking multirate \(\log_d(N, 0, p)\) switching network
- scientific article; zbMATH DE number 2141600 (Why is no real title available?)
- Unique list-colourability and the fixing chromatic number of graphs
- The game of arboricity
- Extending the type reproduction number to infectious disease control targeting contacts between types
- A general theory for target reproduction numbers with applications to ecology and epidemiology
- 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable
- Saturation numbers for linear forests $P_6 + tP_2$
- On disjoint matchings in cubic graphs
- A note on total colourings of digraphs
- Exploring combinatorics and graph theory with simple blokus
- An extension of the essential graph of a ring
- Contagion Source Detection in Epidemic and Infodemic Outbreaks: Mathematical Analysis and Network Algorithms
- On edge-disjoint pairs of matchings
- Perfect, ideal and balanced matrices
- Edge-disjoint spanners in tori
- Physical network design to facilitate capacity reallocation
- The validity of Tutte's 3-flow conjecture for some Cayley graphs
- Complete characterization of odd factors via the size, spectral radius or distance spectral radius of graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4869540)
