scientific article; zbMATH DE number 854567
From MaRDI portal
Publication:4869540
Recommendations
Cited in
(only showing first 100 items - show all)- Equipartite graphs
- Graph theoretic approach to parallel gene assembly
- 2-piercings via graph theory
- Strong structural properties of unidirectional star graphs
- Hamiltonian connectivity of 2-tree-generated networks
- Characterization of a class of graphs related to pairs of disjoint matchings
- On the acyclic chromatic number of Hamming graphs
- Approximation algorithms for maximum latency and partial cycle cover
- Combinatorial designs and the theorem of Weil on multiplicative character sums
- On zero-sum partitions and anti-magic trees
- Edge-disjoint spanners in tori
- Edge searching weighted graphs
- A proof of the Kauffman-Harary conjecture
- 2-cnfs and logical embeddings
- Computational study on planar dominating set problem
- Monomial bases for broken circuit complexes
- Graphs with restricted valency and matching number
- Polychromatic colorings of rectangular partitions
- On the largest eigenvalues of bipartite graphs which are nearly complete
- On super (a,d)-edge-antimagic total labeling of disconnected graphs
- The fractional chromatic number, the Hall ratio, and the lexicographic product
- Multicolored parallelisms of Hamiltonian cycles
- The circular chromatic number of hypergraphs
- Global-stability problem for coupled systems of differential equations on networks
- On the structure of Hamiltonian cycles in Cayley graphs of finite quotients of the modular group
- Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms
- On the local distinguishing numbers of cycles
- Hamiltonian powers in threshold and arborescent comparability graphs
- 9-connected claw-free graphs are Hamilton-connected
- Laplacian graph eigenvectors
- Dot product representations of graphs
- Physical network design to facilitate capacity reallocation
- Motion tracking as a constrained optimization problem.
- Amalgamations of connected \(k\)-factorizations.
- Synchronizing finite automata on Eulerian digraphs.
- A class of perfect graphs containing \(P_{6}\)
- The complexity of the locally connected spanning tree problem
- Distance and connectivity measures in permutation graphs
- The structure of (\(t,r\))-regular graphs of large order
- A note on the bounded fragmentation property and its applications in network reliability
- Powers of geometric intersection graphs and dispersion algorithms
- The stable set of associated primes of the ideal of a graph
- Channel assignment on graphs of bounded treewidth
- Hereditary dominating pair graphs
- Square-free perfect graphs.
- 0-centred and 0-ubiquitously graceful trees.
- Identification of almost invariant aggregates in reversible nearly uncoupled Markov chains
- Verifiable broadcasting and gossiping in communication networks
- An efficient sorting algorithm for a sequence of kings in a tournament.
- Quantified computation tree logic
- Gene assembly through cyclic graph decomposition
- Uniquely 2-list colorable graphs
- On claw-free asteroidal triple-free graphs
- Partition of -electrons among the faces of polyhedral carbon clusters
- A new method optimizing the subgraph centrality of large networks
- The relationship between carbon dioxide emission and economic growth: hierarchical structure methods
- Asymptotic behavior of stochastic multi-group epidemic models with distributed delays
- Packing coloring of Sierpiński-type graphs
- Synchronized stationary distribution of hybrid stochastic coupled systems with applications to coupled oscillators and a Chua's circuits network
- On Cartesian product of Euclidean distance matrices
- Shortest circuit covers of signed graphs
- Stabilization of stochastic complex-valued coupled delayed systems with Markovian switching via periodically intermittent control
- Structure connectivity of hypercubes
- Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II
- A note on co-maximal graphs of commutative rings
- Packing chromatic number versus chromatic and clique number
- On the strong chromatic index of sparse graphs
- The existence and global exponential stability of periodic solution for a neutral coupled system on networks with delays
- The maximum girth and minimum circumference of graphs with prescribed radius and diameter
- On input-to-state stability for stochastic coupled control systems on networks
- Boundedness for network of stochastic coupled Van der Pol oscillators with time-varying delayed coupling
- Outer synchronization of delayed coupled systems on networks without strong connectedness: a hierarchical method
- The multiplex dependency structure of financial markets
- Is there any polynomial upper bound for the universal labeling of graphs?
- A refined algorithm for maximum independent set in degree-4 graphs
- On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability
- Periodic solutions of discrete time periodic time-varying coupled systems on networks
- Ground states of nonlinear Schrödinger equation on star metric graphs
- Multiple weak 2-linkage and its applications on integer flows of signed graphs
- Deficiency of forests
- (Di)graph products, labelings and related results
- Strong resolving graphs: the realization and the characterization problems
- Tree spanners of bounded degree graphs
- A tight lower bound for the hardness of clutters
- A large set of torus obstructions and how they were discovered
- Regularity of powers of bipartite graphs
- Graphs vertex-partitionable into strong cliques
- Periodic solutions for complex-valued neural networks of neutral type by combining graph theory with coincidence degree theory
- On the relation between the positive inertia index and negative inertia index of weighted graphs
- Mostar index
- Stability in mean of partial variables for coupled stochastic reaction-diffusion systems on networks: a graph approach
- Prime power and prime product distance graphs
- On maximum \(k\)-edge-colorable subgraphs of bipartite graphs
- Critical vertices and edges in \(H\)-free graphs
- Synchronization analysis of stochastic coupled systems with time delay on networks by periodically intermittent control and graph-theoretic method
- Dynamics of a stochastic multigroup SIQR epidemic model with standard incidence rates
- Genus of the hypercube graph and real moment-angle complexes
- Graph transformations for efficient structural analysis
- A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time
- The IC-indices of complete multipartite 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)
