Parallel concepts in graph theory
From MaRDI portal
Publication:1324287
DOI10.1016/0895-7177(93)90061-3zbMath0797.05064MaRDI QIDQ1324287
Publication date: 13 October 1994
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0895-7177(93)90061-3
cluster; stars; edge coloring; 1-factor; Steiner triple systems; perfect matching; triangles; galaxy
05C35: Extremal problems in graph theory
05C38: Paths and cycles
05B15: Orthogonal arrays, Latin squares, Room squares
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C15: Coloring of graphs and hypergraphs
Related Items
Chordal rings as fault-tolerant loops, Fast detection and display of symmetry in outerplanar graphs, The free partially commutative Lie algebra: Bases and ranks, Counting asymmetric enriched trees, On a graph partition problem with application to VLSI layout, Integral matrices with given row and column sums, An algorithm for min-cost edge-disjoint cycles and its applications, Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations, Digital Jordan curves---a graph-theoretical approach to a topological theorem, An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree, A model for determining the cost-effectiveness of T1 transmission in certain integrated networks, Total chromatic numbers, Vanishing minor conditions for inverse zero patterns, Analytical bounds for block approximate factorization methods, On graphs having \(\sigma\)-polynomials of the same degree, Distributions on bicoloured binary trees arising from the principle of parsimony, The edge Hamiltonian path problem is NP-complete for bipartite graphs, On uniquely 3-colorable graphs, A generalized chromatic polynomial, acyclic orientations with prescribed sources and sinks, and network reliability, Path-cycle Ramsey numbers, Partitioning, tearing and modification of sparse linear systems, Grotzsh's Heawood coloring theorem, On the maximal order of cyclicity of antisymmetric directed graphs, Optimal labelling of a product of two paths, Matchings in graphs. II, The largest small hexagon, On the vector representation of the reachability in planar directed graphs, Either tournaments or algebras?, On graphs with a constant link. II, On defect-d matchings in graphs, The communication problem on graphs, On matroids on edge sets of graphs with connected subgraphs as circuits. II, Subgraphs as circuits and bases of matroids, A theorem on the maximum number of disjoint Steiner triple systems, The chainable matrix, a special combinatorial matrix, Another class of balanced graph designs: Balanced circuit designs, Cubic graphs on twelve vertices and the line graph of a finite affine plane, On the existence of automorphism free Steiner triple systems, The distribution of degrees in a large random tree, An exact probability distribution on the connectivity of random graphs, Covers, matchings and odd cycles of a graph, Identifying a Gaussian signal after a zero-memory filter, New families of hypohamiltonian graphs, A note on symmetric doubly-stochastic matrices, Some observations on the determination of an upper bound for the clique number of a graph, Graph equations for line graphs and total graphs, Orienting planar graphs, Extremal edge problems for graphs with given hyperoctahedral automorphism group, Traversability and connectivity of the middle graph of a graph, Genus embeddings for some complete tripartite graphs, On decomposition of r-partite graphs into edge-disjoint Hamilton circuits, Planar and infinite hypohamiltonian and hypotraceable graphs, Note on infinite graphs, Ramsey graphs and block designs, Resolvable balanced bipartite designs, Matrices with permanent equal to one, A linear algorithm for the Hamiltonian completion number of a tree, On the distance matrix of a tree, Relations between graphs and integer-pair sequences, Développements recents de la théorie des graphes, Steiner quadruple systems all of whose derived Steiner triple systems are nonisomorphic, Graphs with degrees from prescribed intervals, A method in graph theory, Information networks: A probabilistic model for hierarchical message transfer, The number of distinct latin squares as a group-theoretical constant, Balanced bipartite weighing designs, Partition graphs and coloring numbers of a graph, Ramsey numbers for all linear forests, On tactical configurations with no four-cycles, The homeomorphic embedding of \(K_n\) in the \(m\)-cube, Improved cycle bases for the flexibility analysis of structures, The entire graph of a bridgeless connected plane graph is Hamiltonian, Graph with given achromatic number, Comparison of graphs by their number of spanning trees, A note on degree-constrained star subgraphs of bipartite graphs, On finding all unilaterally connected components of a digraph, Information storage and retrieval - mathematical foundations. II: Combinatorial problems, An asymptotic evaluation of the cycle index of a symmetric group, Data analysis implications of some concepts related to the cuts of a graph, The factorial representation of balanced labelled graphs, Generalizations of line graphs and applications, Some improved bounds on the number of 1-factors of n-connected graphs, Collapsing unicolored graphs, A set-theoretical approach to the problem of hierarchical clustering, On recognizing graph properties from adjacency matrices, Characterization of self-complementary graphs with 2-factors, An Ore-type condition implying a digraph to be pancyclic, On the extreme points of the polytope of symmetric matrices with given row sums, t-designs on hypergraphs, Disjoint independent dominating sets in graphs, The dependence graph for bases in matroids, Testing for Equality between Maximum Matching and Minimum Node Covering, Young subgroups and polynomial identities, Nonisomorphic trees with the same T-polynomial, The Min-Max Spanning Tree Problem and some extensions, Minimal graphs with cyclic color group, Characterizing reduced Witt rings of fields, On k-critical, n-connected graphs, Contractions of graphs: A theorem of Ore and an extremal problem, One counterexample for two conjectures on three coloring, On the (numerical) ranking associated with any finite binary relation, Locally twisted cubes are 4-pancyclic., Identity orientation of complete bipartite graphs, Ramsey numbers of stars versus wheels of similar sizes, On the complexity of the embedding problem for hypercube related graphs, Derangements on the \(n\)-cube, Transfer flow graphs, Generalizations of independence and chromatic numbers of a graph, The number of spanning trees of the generalized hypercube network, Graphs with most number of three point induced connected subgraphs, Conditional chromatic numbers with forbidden cycles, Changing and unchanging of the radius of a graph, Chromatic numbers of competition graphs, Short encodings of planar graphs and maps, A generalization of hypercubes: Complemented graphs, A note on the total chromatic number of Halin graphs with maximum degree 4, On \(F\)-geodetic graphs, On (1, 2)-realizable graphs, Strongly edge triangle regular graphs and a conjecture of Kotzig, Scheduling of independent jobs in star graph networks, Bipartite graphs whose edge algebras are complete intersections, A characterization of level planar graphs, Size in maximal triangle-free graphs and minimal graphs of diameter 2, On colored designs. II, On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\), Bipolar orientations revisited, On pancyclic digraphs, Spanning subgraphs with specified valencies, On simple characterizations of k-trees, Graphs of given genus and arbitrarily large maximum genus, Generalised Ramsey numbers for small graphs, Terminable and interminable paths and trails in infinite graphs, One method for proving the impossibility of certain Moore graphs, Walkwise and admissible mappings between digraphs, Stable and semi-stable unicyclic graphs, On hypohamiltonian graphs, Cutting down recursive trees, Every regular graph is a quasigroup graph, Line-critical point determining and point distinguishing graphs, Principle of inclusion-exclusion on semilattices, 2-symmetric transformations for 3-manifolds of genus 2, On the achromatic number of hypercubes, Sinks in acyclic orientations of graphs, Line graphs and forbidden induced subgraphs, On the isomorphisms of Cayley graphs of Abelian groups., Fault-diagnosis of grid structures., Forest matrices around the Laplacian matrix, A non-ambiguous decomposition of regular languages and factorizing codes, Homological conditions for graphical splittings of antisocial graph groups, The probability of collective choice with shared knowledge structures, Determination of the bases of a splitting matroid, Is the formal energy of the mid-point rule convergent?, Which non-regular bipartite integral graphs with maximum degree four do not have \(\pm 1\) as eigenvalues?, On the lengths of symmetry breaking-preserving games on graphs, On the hull sets and hull number of the Cartesian product of graphs, Combinatorial structures associated with Lie algebras of finite dimension, Analyzing cognitive maps to help structure issues or problems, Nearly sign-nonsingular matrices, Triangle graphs, The reversing number of a digraph, Minimum proper interval graphs, Intersection number and capacities of graphs, Generalized Latin squares. II, Cycle interpolation properties of graphs, Searching for acyclic orientations of graphs, The shifting algorithm technique for the partitioning of trees, On strongly asymmetric graphs, Irrational conformal field theory, Trees that are sphere-of-influence graphs, Topological properties of the intersection graph of covers of \(n\)-dimensional surfaces, On the radius and diameter of the clique graph, Self-dual graphs, A characterization of \(n\)-component graphs, Recursive spectral algorithms for automatic domain partitioning in parallel finite element analysis, Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs, Sign-nonsingular skew-symmetric matrices, On path-chromatically unique graphs, A characterization of graphs \(G\) with \(G\cong K^ 2(G)\), Trees with diameter less than 5 and non-singular complement, No-hole \(k\)-tuple \((r+1)\)-distant colorings, Ejection chains, reference structures and alternating path methods for traveling salesman problems, Laplacian spectra and spanning trees of threshold graphs, Homomorphically full graphs, A study of maximum unit-circle caterpillars---tools for the study of the shape of adsorption patterns, Cubic \((m,n)\)-metacirculant graphs which are not Cayley graphs, Incrementally extensible hypercube networks and their fault tolerance, Nordhaus-Gaddum inequalities for domination in graphs, Embedding trees in recursive circulants, On the Steiner median of a tree, Twistor integral representations of fundamental solutions of massless field equations, The geodetic number of an oriented graph, Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time, On upper bound graphs with respect to operations on graphs, An algorithm for obtaining the chromatic number and an optimal coloring of a graph, Automorphism groups of graphs and edge-contraction, Des cycles et cocycles en hypergraphes, On copositive matrices with -1, 9, 1 entries, On a matrix identity connecting iteration operators associated with a \(p\)-cyclic matrix, A characterization and hereditary properties for partition graphs, Topological properties of star graphs, A note on finite topologies and switching functions, Distance matrix polynomials of trees, Frequency partitions: Forcibly pancyclic and forcibly nonhamiltonian degree sequences, Uniquely intersectable graphs, Matroids from directed graphs, Hyperbolic trees, On the algebraic structure of rooted trees, A Turan type problem for interval graphs, On separating cycles in graphs, Bounds for the covering number of a graph, Characterizations of 2-variegated graphs and of 3-variegated graphs, Studies on the balancing, the minimal balancing, and the minimum balancing processes for social groups with planar and nonplanar graph structures, On k-minimally n-edge-connected graphs, New bounds for the clique number of a graph, The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two, A new type of combinatorial design, Characterizations of outerplanar graphs, On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs, A test for legitimate decks, Graph isomorphism, general remarks, A unified treatment of nearly reducible and nearly decomposable matrices, Neighbor designs, Counterexamples to the Edge Reconstruction Conjecture for infinite graphs, A critical path generalization of the additive factor method: Analysis of a stroop task, On the cyclomatic number of a hypergraph, The graphs with only self-dual signings, The total coloring of a multigraph with maximal degree 4, Graph 2-isomorphism is NP-complete, Trading independent for synchronized parallelism in finite copying parallel rewriting systems, Extensions of coloring models for scheduling purposes, Cohen-Macaulay rings associated with digraphs, On the relations between arboricity and independent number or covering number, K-center and K-median problems in graded distances, Periodicities on trees, Orders, reduction graphs and spectra, DNA models and algorithms for NP-complete problems, Checking the convexity of polytopes and the planarity of subdivisions, On the algorithmic complexity of twelve covering and independence parameters of graphs, Knots and graphs. I: Arc graphs and colorings, Symmetrization inequalities for difference equations on graphs, Remarks on the thickness of a graph, Graphical \(t\)-designs via polynomial Kramer-Mesner matrices, On the out-domination and in-domination numbers of a digraph, Clique divergent graphs with unbounded sequence of diameters, On point-set domination in graphs. IV: Separable graphs with unique minimum psd-sets, Cycle-factorization of symmetric complete multipartite digraphs, The realization graph of a degree sequence with majorization gap 1 is Hamiltonian, Chromatic polynomials of homeomorphism classes of graphs, A sublinear bound on the chromatic index of multigraphs, The line index and minimum cut of weighted graphs, The zero-divisor graph of a commutative ring, Locally pancyclic graphs, A self-stabilizing distributed algorithm to find the median of a tree graph, Classes of chromatically unique or equivalent graphs, Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices, Reverse binary graphs, Vulnerability in graphs of diameter four, Hypercubes, shuffle-exchange graphs and de Bruijn digraphs, Abstract sphere-of-influence graphs, The geodetic number of a graph, Quantifying fault recovery in multiprocessor systems, Variations on a hypercube: Embellishments of parallel architectures, Subgraph generating functions in chemistry---an example for perfect matchings on honeycomb fragments, Construction of graphs with special properties, No-hole 2-distant colorings, Finding extremal sets in less than quadratic time, Sum graphs over all the integers, Some determinant expansions and the matrix-tree theorem, Realizing the chromatic numbers of triangulations of surfaces, Representation of smooth surfaces by graphs. Transformations of graphs which do not change the Euler characteristic of graphs, A result about the incident edges in the graphs \(M_ k\), A counterexample to a conjecture on the bondage number of a graph, Transformations of one-dimensional cellular automaton rules by translation-invariant local surjective mappings, Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs, Enumeration of basic kinematic chains with simple and multiple joints, Properties of grammatical codes of trees, Computational complexity of loss networks, Recognition algorithm for intersection graphs of edge disjoint paths in a tree, Minimal graphs of a torus, a projective plane and spheres and some properties of minimal graphs of homotopy classes, Minors of quasi 4-connected graphs, Minimum degree games for graphs, The square of a chordal graph, A class of clique-closed graphs, On antichain intersection numbers, total clique covers and regular graphs, Parallel concepts in graph theory, Geometric classification of triangulations and their enumeration in a convex polygon, Optimal data exchange algorithms on star graphs, Acyclic edge-colorings of sparse graphs, A pumping lemma and the structure of derivations in the boundary NLC graph languages, A depth-first search routing algorithm for star graphs and its performance evaluation, Hard-to-color graphs for connected sequential colorings, Data structures for two-edge connectivity in planar graphs, The binding numbers of some Cartesian products of graphs, The generating polynomial and Euler characteristic of intersection graphs, About triangles in a graph and its complement, Good and semi-strong colorings of oriented planar graphs, Obstruction set isolation for the gate matrix layout problem, Combinatorial algorithms on a class of graphs, Some properties of contractible transformations on graphs, The generating power of boundary NLC graph grammars and cycle graphs, Computational complexity of compaction to irreflexive cycles, BRS-compactness in networks: Theoretical considerations related to cohesion in citation graphs, collaboration networks and the internet, Tree 3-spanners on interval, permutation and regular bipartite graphs, On some decision problems for trace codings, Linear bounds for on-line Steiner problems, 1-Approximation algorithm for bottleneck disjoint path matching, On the generalized twisted cube, Trivalent Cayley graphs for interconnection networks, Graph theoretic aspects of maximizing the spectral radius of nonnegative matrices, On matrix structures invariant under Toda-like isospectral flows, From ternary strings to Wiener indices of benzenoid chains, Dynamic algorithms for shortest paths in planar graphs, A new variation on hypercubes with smaller diameter, Coloring a graph optimally with two colors, Maintenance of 2- and 3-edge-connected components of graphs. I, Packings and perfect path double covers of maximal planar graphs, Extremal graphs domination insensitive to the removal of \(k\) edges, The decomposition of graphs into \(k\)-connected components, Classes of chromatically unique graphs, 2-colourings in \(S(t, t+1, v)\), A shifting algorithm for constrained min-max partition on trees, One factors and the existence of affine designs, The coordinate representation of a graph and \(n\)-universal graph of radius 1, No-hole \((r+1)\)-distant colorings, Two strongly polynomial cut cancelling algorithms for minimum cost network flow, Curve-constrained drawings of planar graphs, On domination and independent domination numbers of a graph, The mixed postman problem, Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs, Some howell designs of prime side, On the relationship between the genus and the cardinality of the maximum matchings of a graph, Subgraphs with triangular components, Constructions of point-colour-symmetric graphs, Trees with structures, Path traversability in planar graphs, On End-regular graphs, On the bondage number of a graph, The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests, Voronoi diagrams from convex hulls, Lower bounds on the cardinality of the maximum matchings of planar graphs, The number of open chains of length three and the parity of the number of open chains of length k in self-complementary graphs, On the existence of uncountably many matroidal families, The subgraph homeomorphism problem, On the inverse M-matrix problem for (0,1)-matrices, Generalized Ramsey theory for graphs, X: Double stars, An interconnection of local maps inducing onto global maps, Digraphs with real and Gaussian spectra, On a variation of the Oberwolfach problem, Time-space tradeoffs for computing functions, using connectivity properties of their circuits, The node-deletion problem for hereditary properties is NP-complete, On finding minimal length superstrings, The relative neighbourhood graph of a finite planar set, A combinatorial optimization problem: optimal generalized cycle bases, Center sets and ternary codes, Edge orientations on cubic graphs with a maximum number of pairs of oppositely oriented edges, On the number of Hamiltonian cycles in tournaments, Ramsey numbers for matchings, On n-extendable graphs, The least point covering and domination numbers of a graph, Trees with 1-factors and oriented trees, On the thickness of graphs of given degree, A necessary and sufficient condition for a graph \(G\) with diameter 5 to be 2-diameter-stable, Stable properties of graphs, Accessibility: A criterion for regularity and hierarchy in visual pattern codes, Planar orientations with low out-degree and compaction of adjacency matrices, Triangles in 3-connected matroids, Mathematical construction of an autonomous artificial life, Conditioning analysis of sparse block approximate factorizations, Restriction of simple games, On the largest strong components in \(m\)-out digraphs, Random subgraphs of the \(n\)-cycle and the \(n\)-wheel, Strongly indexable graphs, The harmonious coloring number of a graph, On the tree packing problem, Transitive multipermutation graphs: Case \(4\leq n\leq m\), Tree-partitions of infinite graphs, On-line computation of minimal and maximal length paths, On packing and covering numbers of graphs, Edge colouring line graphs of unicyclic graphs, On the 2-extendability of planar graphs, Optimal fault-tolerant routings for connected graphs, Minimal regular graph containing a given graph, Topological code of graphs, Infiltration games on arbitrary graphs, Generalized Cayley graphs, Exact coverings of 2-paths by Hamilton cycles, Constructing compact rectilinear planar layouts using canonical representation of planar graphs, Reliability analysis of networks using stochastic model, Unimodular equivalence of graphs, Deciding whether graph \(G\) has page number one is in NC, Lower eigenvalue bounds for singular pencils of matrices, The medial graph and voltage-current duality, On zero-sum Ramsey numbers--stars, Plurality preference digraphs realized by trees. II: On realization numbers, Optimal parallel algorithms for finding cut vertices and bridges of interval graphs, Arrangement graphs: A class of generalized star graphs, On the intersection rank of a graph, Stirling networks: A versatile combinatorial topology for multiprocessor systems, Connectivity, persistence and fault diagnosis of interconnection networks based on \(O_ k\) and \(2O_ k\) graphs, Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs, Combinatorial reciprocity theorems, Connectivity of iterated line graphs, Completions of P-matrix patterns, Endomorphism-regularity of split graphs, Graphs with bounded induced distance, Representing graphs implicitly using almost optimal space, Symmetry groups of some perfect 1-factorizations of complete graphs, Independence numbers of product graphs, Embedding complete trees into the hypercube, Connected hyperplanes in binary matroids, Stratified negation in temporal logic programming and the cycle-sum test, Approximation algorithms for maximum two-dimensional pattern matching, Nonmonotonic reasoning by inhibition nets, A nonadaptive NC checker for permutation group intersection, On the number of inductively minimal geometries, On the complexity of orthogonal compaction, The Shields-Harary indices of vulnerability of a graph, Divisible, torsion-free, and act regular generalized act wreath products, A minimum broadcast graph on 26 vertices, Efficient line broadcasting in a \(d\)-dimensional grid, Locally bounded hereditary subclasses of \(k\)-colourable graphs, Convexity in oriented graphs, A priori optimization for the probabilistic maximum independent set problem, Symmetric magic squares and multivariate splines, Graph theoretic analysis of PLA folding heuristics, On certain Hamiltonian inner triangulations, Independent domination in hypercubes, The irregularity cost or sum of a graph, Multicyclic treelike reflexive graphs, Spectra and energies of iterated line graphs of regular graphs, \(A\,V^ 2\) algorithm for determining isomorphism of planar graphs, The cutting center theorem for trees, Large cycles in graphs, Homomorphisms of derivative graphs, On edge but not vertex transitive regular graphs, On graphs with at most four line-disjoint paths connecting any two vertices, Forbidden subgraphs for graphs with planar line graphs, Arc colorings of digraphs, An \(n^ 2\) algorithm for determining the bridges of a graph, On the automorphism group of a matroid, An extremal problem in the uniform covering of finite sets, A graph polynomial and its applications, A note on the line reconstruction problem, Wagner's theorem for torus graphs, Two applications of semi-stable graphs, Graph decompositions, handcuffed prisoners and balanced p-designs, The uniquely embeddable planar graphs, On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs, The square of every two-connected graph is Hamiltonian, Tough graphs and Hamiltonian circuits., A note on line coverings of graphs, A characterization of finite distributive planar lattices, On computing the time complexity of transitive closure algorithms, Theory of path length distributions. I, A characterization of bivariegated trees, Graphs with valency k, edge connectivity k, chromatic index k+1 and arbitrary girth, On valid sequences considered by Wigner, The number of caterpillars, Graphs with specified radius and diameter, An interpolation theorem for partitions which are complete with respect to hereditary properties, Self-spanner graphs, Rebuilding convex sets in graphs, Temporal stratification tests for linear and branching-time deductive databases, Lie algebras associated with triangular configurations, Tutte uniqueness of line graphs, Chromatic-index-critical graphs of orders 13 and 14, The first order definability of graphs with separators via the Ehrenfeucht game, Orthogonal drawings of graphs with vertex and edge labels, Multiplicities of edge subrings, Normality of semigroups with some links to graph theory., A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results, On pure structure of dynamic systems, Determining finite graphs by their large Whitney levels, The existence of infinitely many primary trees, \(T\)-chromatic polynomials, A homology theory for colored graphs, Graph perturbations, The gracefulness of a class of lobster trees, Constant-time parallel recognition of split graphs, Parallel algorithms for connectivity problems on interval graphs, Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems, On fault-tolerant embedding of Hamiltonian circuits in line digraph interconnection networks, The center of an infinite graph, The structure of quasi 4-connected graphs, On indexable graphs, Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes, Star-factorization of symmetric complete bipartite digraphs, Long cycles and long paths in the Kronecker product of a cycle and a tree, Chromatic uniqueness in a family of 2-connected graphs, Intersection properties of line graphs, On colored designs. I, Totally equimatchable graphs, Cyclic and cliquewise connectedness of line graphs, Binary vectors partially determined by linear equation systems, New results about the bondage number of a graph, Stage-graph representations, Connectivity of the mutual \(k\)-nearest-neighbor graph in clustering and outlier detection, A calculus of stochastic systems for the specification, simulation, and hidden state estimation of mixed stochastic/nonstochastic systems, Some problems on chromatic polynomials, Chromatic polynomials with least coefficients, Planar graphs with least chromatic coefficients, A bibliography on chromatic polynomials, An approval-voting polytope for linear orders, Dynamic graph models, Cycles and cocycles of fuzzy graphs, Restrictions of minimum spanner problems, The existence of homeomorphic subgraphs in chordal graphs, The e-mail gossip number and the connected domination number, Uniformly one-connected matrices and their inverses, On properties of unit interval graphs with a perceptual motivation, Using maximality and minimality conditions to construct inequality chains, Asymptotic behaviour of the observability of \(Q_ n\), Multiplicativity of acyclic digraphs, On the characterization of graphs with maximum number of spanning trees, Adjacency of vertices of the complete pre-order polytope, The color cost of a caterpillar, On two new classes of semibiplanes, A-optimal connected block designs with nearly minimal number of observations, The integral closure of subrings associated to graphs, Antipodal covers of strongly regular graphs, Integral sum graphs from identification, On chromatic sums and distributed resource allocation, Maximum tree-packing in time \(O(n^{5/2})\), Finding optimal subgraphs by local search, Embedding ladders and caterpillars into the hypercube, Indecomposable triple systems, Inequalities for the chromatic numbers of graphs, The Ramsey numbers r(P\(_m\),K\(_n\)), Hypohamiltonian and hypotraceable graphs, Pushing blocks is hard., Weak-order extensions of an order., Minimum 3-geodetically connected graphs, On the minimum local-vertex-connectivity augmentation in graphs, Characterization of optimal key set protocols, A graph theoretical determination of solvable complete rigid Lie algebras., Risk transportation via a clique number problem formulation., Solving a vehicle routing problem by balancing the vehicles time utilization., Matrix completion problems for pairs of related classes of matrices., Graphs with only caterpillars as spanning trees, Algebraic properties of location problems with one circular barrier., Extremal connected graphs for independent domination number, A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree., Barycentric sequences and barycentric Ramsey numbers for stars., On approximability of linear ordering and related NP-optimization problems on graphs., Minimum restricted diameter spanning trees., Uncertainty measure on fuzzy partitions., On extendibility of voltage and current regimes from subnetworks, Algorithms and obstructions for linear-width and related search parameters, Boolean connection algebras: A new approach to the Region-Connection Calculus, Bounding the bandwidths for graphs, Proof of a conjecture in domination theory, Some families of chromatically unique bipartite graphs, Characterisation of potentially generalised bipartite self-complementary bi-graphic sequences, Packing graphs in their complements, Characterisation of self-complementary chordal graphs, A short solution of Heawood's empire problem in the plane, Spanning trees on hypercubic lattices and nonorientable surfaces, Semi-dynamic breadth-first search in digraphs, The number of edges in a subgraph of a Hamming graph, Optimal gray-code labeling and recognition algorithms for hypercubes, A 2-approximation algorithm for the minimum weight edge dominating set problem, On approximability of the independent/connected edge dominating set problems, A new graph characteristic and its application to numerical computability, Graph-theoretic procedures for dimension identification, An efficient algorithm for solving the homogeneous set sandwich problem, The shuffle-cubes and their generalization, An algorithm for prescribed multiple domination in arbitrary graphs, Perfect edge domination and efficient edge domination in graphs, The crossing number of \(C(n; \{1,3\})\), A note: Some results in step domination of trees, A modular approach to Sprouts, Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs
Cites Work
