scientific article; zbMATH DE number 854567
From MaRDI portal
Publication:4869540
zbMATH Open0845.05001MaRDI QIDQ4869540FDOQ4869540
Authors: Douglas B. West 
Publication date: 11 March 1996
Title of this publication is not available (Why is that?)
Recommendations
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)
Cited In (only showing first 100 items - show all)
- Fast-mixed searching and related problems on graphs
- A new result on the problem of Buratti, Horak and Rosa
- Packing trees of unbounded degrees in random graphs
- Stability of random impulsive coupled systems on networks with Markovian switching
- Lattices, whose incomparability graphs have horns
- On the size of 3-uniform linear hypergraphs
- Super restricted edge connectivity of regular edge-transitive graphs
- Global stability of coupled nonlinear systems with Markovian switching
- Linearly independent vertices and minimum semidefinite rank
- Combinatorics on update digraphs in Boolean networks
- Fast edge searching and fast searching on graphs
- On the induced matching problem
- The validity of Tutte's 3-flow conjecture for some Cayley graphs
- A note on total colourings of digraphs
- On disjoint matchings in cubic graphs
- On the Buratti-Horak-Rosa conjecture about Hamiltonian paths in complete graphs
- The complexity of the zero-sum 3-flows
- Combinatorial Green's function of a graph and applications to networks
- Combinatorial designs and the theorem of Weil on multiplicative character sums
- Bipartite bihypergraphs: a survey and new results
- Improved parameterized and exact algorithms for cut problems on trees
- Chromatic-index-critical graphs of orders 13 and 14
- Kotzig frames and circuit double covers
- Lexicographic products with high reconstruction numbers
- Universal cycles of classes of restricted words
- The stable set of associated primes of the ideal of a graph
- Polychromatic colorings of plane graphs
- Graphs with restricted valency and matching number
- Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected
- Graph theoretic approach to parallel gene assembly
- On the local distinguishing numbers of cycles
- On the commuting graph of semidihedral group
- Polychromatic colorings of rectangular partitions
- Graph imperfection. I
- Enumerative aspects of secondary structures
- Prime power and prime product distance graphs
- On the complexity and algorithm of grooming regular traffic in WDM optical networks
- Stability in mean of partial variables for coupled stochastic reaction-diffusion systems on networks: a graph approach
- On relative length of longest paths and cycles
- Packing chromatic number versus chromatic and clique number
- Recognizing line-polar bipartite graphs in time \(O(n)\)
- Composition of stable set polyhedra
- Hamiltonian connectivity of 2-tree-generated networks
- Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
- A min-max property of chordal bipartite graphs with applications
- On the structure of the commuting graph of Brandt semigroups
- Counting Hamiltonian cycles in bipartite graphs
- Interval edge-coloring: A model of curriculum scheduling
- List-antimagic labeling of vertex-weighted graphs
- New results on stability of random coupled systems on networks with Markovian switching
- Hamiltonian powers in threshold and arborescent comparability graphs
- Polarity of chordal graphs
- A forbidden subgraph characterization of line-polar bipartite graphs
- Essential obstacles to Helly circular-arc graphs
- Global exponential stability for stochastic coupled systems on networks with Markovian switching
- Full edge-friendly index sets of complete bipartite graphs
- An exact algorithm for the minimum dominating clique problem
- Distance and connectivity measures in permutation graphs
- Constructing graphs with no immersion of large complete graphs
- Edge-antimagic graphs
- Polychromatic colorings of bounded degree plane graphs
- On the Independence Number of Graphs with Maximum Degree 3
- Edge-colorings avoiding rainbow and monochromatic subgraphs
- On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs
- A decomposition theorem for chordal graphs and its applications
- The undirected power graph of a finite group.
- Mengerian temporal graphs revisited
- Construction of cospectral integral regular graphs
- Maximum nullity and zero forcing of circulant graphs
- Generalization of Erdős-Gallai edge bound
- Barrel pseudotilings
- Super-edge-graceful labelings of some cubic graphs
- Super \((a, d)\)-EAT labeling of subdivided stars
- Even-hole-free graphs. I: Decomposition theorem
- Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints
- Graph-theoretic method on exponential synchronization of stochastic coupled networks with Markovian switching
- Synchronization of coupled stochastic complex-valued dynamical networks with time-varying delays via aperiodically intermittent adaptive control
- Induced embeddings into Hamming graphs
- Global stability for discrete Cohen-Grossberg neural networks with finite and infinite delays
- Some new perspectives on global domination in graphs
- Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors
- Graphs with \(\chi=\Delta\) have big cliques
- Sphere-of-influence graphs using the sup-norm
- On super \((a, d)\)-edge-antimagic total labeling of special types of crown graphs
- The existence of \((K_2\times K_6)\)-designs
- Intersection graph of a module
- Triangle-free graphs whose independence number equals the degree
- Gene assembly through cyclic graph decomposition
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
- Regularity, depth and arithmetic rank of bipartite edge ideals
- On a conjecture about trees in graphs with large girth
- A dichotomy for minimum cost graph homomorphisms
- Identification of almost invariant aggregates in reversible nearly uncoupled Markov chains
- Characterization of common-edge sigraph
- General graph pebbling
- Circumferences of \(k\)-connected graphs involving independence numbers
- On Injective Colourings of Chordal Graphs
- Embedding hypercubes, rings, and odd graphs into hyper-stars
- Non-minimal degree-sequence-forcing triples
- Finite prime distance graphs and 2-odd 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)
