Parallel concepts in graph theory
From MaRDI portal
Publication:1324287
DOI10.1016/0895-7177(93)90061-3zbMath0797.05064OpenAlexW2019588842MaRDI 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
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items
Two topics in tree inference: locating a phonological network effect in immediate recall and arborescence partitive set form, The recognition of geodetically connected graphs, Breaking symmetry in complete graphs by orienting edges: asymptotic bounds, Path-based depth-first search for strong and biconnected components, Finding and counting small induced subgraphs efficiently, Recognizing cographs and threshold graphs through a classification of their edges, On graphs whose graphoidal domination number is one, Radio mean labeling of a graph, The forcing vertex detour monophonic number of a graph, Zero ring labeling of graphs, \(k\)-Zumkeller labeling for twig graphs, Odd mean labeling of chain of graphs, Further results on vertex equitable graphs, Odd harmonious labeling of some new families of graphs, Some results on edge pair sum labeling, Finite abelian group labeling, Intersection graphs of cyclic subgroups of groups, Constructions of 1-uniform dcsl graphs using well-graded families of sets, Bounds on graphoidal length of a graph, Changing and unchanging in \(m\)-eternal total domination in graphs, Radio secure number of a graph, Upper detour monophonic number of a graph, Absorption Cayley graph, On the Laplacian spectra of some variants of corona, Vertex coloring of graphs with few obstructions, Binary contraction of 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, The Zagreb coindices of graph operations, Use of the Szeged index and the revised Szeged index for measuring network bipartivity, Some extended results on diameter-stable graphs, A history of graph entropy measures, A sufficient condition for the existence of an anti-directed 2-factor in a directed graph, Minimal strong digraphs, A generalization of Boesch's theorem, The disconnection number of a graph, Locally bounded coverings and factorial properties of graphs, Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips, Optimal broadcasting for locally twisted cubes, The domination numbers of cylindrical grid graphs, On switching classes, NLC-width, cliquewidth and treewidth, Improper C-colorings of graphs, Bipolar fuzzy graphs, On 3-connected Hamiltonian line graphs, On the existence of \(k\)-sun systems, On the zero divisor graphs of \(pm\)-lattices, The walk distances in graphs, Vertex coloring without large polychromatic stars, Links between two semisymmetric graphs on 112 vertices via association schemes, Backup 2-center on interval graphs, Measuring distances between complex networks, \(E\)-super vertex magic labelings of graphs, The spectrum and the signless Laplacian spectrum of coronae, Edge covering pseudo-outerplanar graphs with forests, Turing-Hopf instability in biochemical reaction networks arising from pairs of subnetworks, On the Zagreb indices of the line graphs of the subdivision graphs, Extremal properties of the bipartite vertex frustration of graphs, On upper bounds for parameters related to the construction of special maximum matchings, Sampling complete designs, 3-consecutive edge coloring of a graph, Extended Petersen networks, Balance in gain graphs - a spectral analysis, 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, Computation of isotopisms of algebras over finite fields by means of graph invariants, From ternary strings to Wiener indices of benzenoid chains, Interval edge-colorings of composition of graphs, 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, On the Laplacian coefficients of unicyclic graphs with prescribed matching number, Interval-valued fuzzy graphs, Some special minimum \(k\)-geodetically connected graphs, The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs, Structure of a Morse form foliation on a closed surface in terms of genus, Bounds for the signless Laplacian energy, Line graph of combinations of generalized Bethe trees: Eigenvalues and energy, On products and line graphs of signed graphs, their eigenvalues and energy, Line graph eigenvalues and line energy of caterpillars, On the skew energy of orientations of hypercubes, Relations between adjacency trees, Hypergraph polytopes, The eccentric connectivity index of nanotubes and nanotori, A linear algorithm for the cutting center of a tree, The bounded degree problem for NLC grammars is decidable, The number of perfect matchings in a hypercube, On nonnegative factorization of matrices, The complexity of finding two disjoint paths with min-max objective function, Vector representations of graphs, Domination alteration sets in graphs, Computing the boxicity of a graph by covering its complement by cointerval graphs, The role of complexity in comparing classifications, A survey of some problems in combinatorial designs - a matrix approach, On the chromatic uniqueness of bipartite graphs, Switching invariant two-path signed graphs, System structure: stability and controllability, On k-graceful, countably infinite graphs, Hamiltonian threshold graphs, Search problems on graphs, Large minimal sets which force arithmetic progressions, A linear algorithm for embedding planar graphs using PQ-trees, Testing the theory of evolution: A novel application of combinatorial optimization, The computational complexity of inferring rooted phylogenies by parsimony, Finding the two-core of a tree, Sign patterns of matrices and their inverses, The facility layout problem, Construction of crossing-critical graphs, On local convexity in graphs, Combinatorial properties of boundary NLC graph languages, On the Ramsey numbers r(G,nH) and r(nG,nH) when n is large, On combinatorial differential equations, Edge-connectivity augmentation problems, On Hamiltonian cycles in Cayley graphs of wreath products, An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs, Steiner problem in Halin networks, A Ramsey problem of Harary on graphs with prescribed size, What can we hope to accomplish in generalized Ramsey theory ?, Some parameters of graph and its complement, On some counting polynomials in chemistry, Embedding and characterization of quantum chemical reaction graphs on two-dimensional orientable surfaces, On computing a conditional edge-connectivity of a graph, Branching in graphs and molecules, Low density series expansions for backbone properties of percolation clusters, Some applications of graph theory to the study of polymer configuration, Combinatorial characterization of hexagonal systems, The location of central structures in trees, A linear-time algorithm for finding a minimum spanning pseudoforest, Minimum-maximal matching in series-parallel graphs, Amortized efficiency of a path retrieval data structure, On the parameter \(v_ 2(h)\) for \(L_ 2\)-coloured graphs, On a generalization of transitivity for digraphs, Some new computer generated results in Ramsey graph theory, Reliability properties of the hypercube network, Automorphism groups and the full state spaces of the Petersen graph generalizations of \(G_{32}\), The starlike trees which span a hypercube, A survey of the theory of hypercube graphs, Cubical graphs and cubical dimensions, A parallel algorithm for bisection width in trees, Graph graphics: Theory and practice, Connectionist networks qua graphs, Representative graphs of r-regular partial planes and representation of orthomodular posets, On a scheduling problem where a job can be executed only by a limited number of processors, Chromatic polynomials and network reliability, On Ramsey numbers for large disjoint unions of graphs, Wreath products of acts over monoids. I: Regular and inverse acts, Graph theoretic foundations of pathfinder networks, A unique hierarchy on the successive condensations of a digraph, Graphical partially ordered sets, Node-graceful graphs, Ramsey numbers based on \(C_ 5\)-decompositions, A short proof of Kundu's k-factor theorem, A fast backtrack algorithm for graph isomorphism, The number of maximal independent sets in a connected graph, Finding the composite outer boundary and holes of a set of closed curves, Theory of traces, Fuzzy intersection graphs, An application of the planar separator theorem to counting problems, A fast parallel coloring of planar graphs with five colors, Dominating sets in social network graphs, Tight bounds on the spectral radius of asymmetric nonnegative matrices, Fault-tolerant routings in a \(\kappa\)-connected network, Partial triple systems and edge colourings, A linear-processor algorithm for depth-first search in planar graphs, Some models of graphs for scheduling sports competitions, Intersection graphs for families of balls in \(R^n\), Enumerating phylogenetic trees with multiple labels, The number of spanning trees of the generalized Boolean \(n\)-cube network, On hypergraph acyclicity and graph chordality, Finding paths and deleting edges in directed acyclic graphs, Variations on the Ising problem, Subtree isomorphism is NC reducible to bipartite perfect matching, On point-linear arboricity of planar graphs, Structural and behavioral equivalence relations in automata networks, The subgraph homeomorphism problem for small wheels, \(P_ 3\)-factorization of complete bipartite graphs, Axioms for consensus functions on undirected phylogenetic trees, Counting spanning trees in the graphs of Kleitman and Golden and a generalization, The maximum number of cliques in dense graphs, Computer generation of all 1-factors for a class of graphs with all vertices of degree two or three, Triangulated edge intersection graphs of paths in a tree, The complexity of facets (and some facets of complexity), An approach to the subgraph homeomorphism problem, Analysis of heuristics for finding a maximum weight planar subgraph, Eccentric graphs, Lins-Mandel crystallizations, Structural consequences of individual position in nondyadic social networks, Finding extreme points in three dimensions and solving the post-office problem in the plane, The greedy and Delaunay triangulations are not bad in the average case, The hull number of a graph, 1-homogeneous graphs, Locally geodesic cycles in 2-self-centered graphs, A polynomial algorithm for constructing the clique graph of a line graph, On completion problems for various classes of \(P\)-matrices, Communicability graph and community structures in complex networks, Generalized honeycomb torus is Hamiltonian, A note on the graph's resolvent and the multifilar structure, An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity, The rook problem on saw-toothed chessboards, Neural voting machines, Destroying automorphisms by fixing nodes, Optimal doublecast path in hexagonal honeycomb mesh, Further analysis of the number of spanning trees in circulant graphs, The planar Ramsey number \(PR(K_4-e,K_5\)), Network topology and the efficiency of equilibrium, Faber-Krahn type inequalities for trees, Complexity results in graph reconstruction, Light graphs in families of outerplanar graphs, Dense sets and embedding binary trees into hypercubes, Monophonic numbers of the join and composition of connected graphs, Hamiltonicity of complements of middle graphs, Old and new results on algebraic connectivity of graphs, Laplacian integral graphs in \(S(a, b)\), The crossing numbers of products of 5-vertex graphs with cycles, Spectrally arbitrary patterns: Reducibility and the \(2n\) conjecture for \(n = 5\), The number of spanning trees in directed circulant graphs with non-fixed jumps, Area-efficient planar straight-line drawings of outerplanar graphs, Cubic symmetric graphs of order a small number times a prime or a prime square, On \(b\)-chromatic number of Sun let graph and wheel graph families, Sampling dynamic networks with application to investigation of HIV epidemic drivers, The complexity of regular DNLC graph languages, Boundary graph grammars with dynamic edge relabeling, 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, Combinatorial approach for computing the characteristic polynomial of a matrix, Fundamental group and cycle space of dual graphs and applications, Outer-embeddability in certain pseudosurfaces arising from three spheres, On real number labelings and graph invertibility, On a construction using commuting regular graphs, Inverses of \(q\)-distance matrices of a tree, Subgraphs of minimal degree \(k\), Remarques sur deux problèmes extrémaux. (Remarks on two extremal problems), A note on set union with arbitrary deunions, 2-symmetric crystallizations and 2-fold branched coverings of \(S^ 3\), 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, Counting trees in directed regular multigraphs, Two families of graphs satisfying the cycle basis interpolation property, On the 2-extendability of the generalized Petersen graphs, Trees with structures, Path traversability in planar graphs, The macrodynamics of open systems and the variational principle of the local potential. II: Applications, Applications of edge coverings by cliques, A short constructive proof of A.R. Rao's characterization of potentially \(K_{r+1}\)-graphic sequences, Quantitative graph theory: a new branch of graph theory and network science, The chromatic index of graphs with large maximum degree, An algorithm to recognize a middle graph, A general program scheme for finding bridges, A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs, Transmission facility planning in telecommunications networks: A heuristic approach, Counting and coding identity trees with fixed diameter and bounded degree, A table of connected graphs on six vertices, A note on stability of graphs, Infinite families of crossing-critical graphs with a given crossing number, Graphs uniquely Hamiltonian-connected from a vertex, Graph equations for line graphs, total graphs, middle graphs and quasi- total graphs, An extremal problem in geodetic graphs, Reduction graphs in the lambda calculus, A game of cops and robbers, Edge-contraction problems, A convex characterization of the graphs of the dodecahedron and icosahedron, Non-\(\kappa\)-critical vertices in graphs, On large sets of disjoint Steiner triple systems. IV, The chromaticity of wheels, A generalization of outerplanar graphs, Hypergraphs and Whitney's theorem on edge-isomorphisms of graphs, Upper bounds on the edge clique cover number of a graph, Note on a pursuit game played on graphs, Generation of trees of a graph with the use of decomposition, Un problème de connectivité sur les espaces métriques, On maximum critically h-connected graphs, Permanental roots and the star degree of a graph, Three color Ramsey number of \(K_ 4-e\), On parallelism and convergence of incomplete LU factorizations, Upper bound for linear arboricity, The structure of the models of decidable monadic theories of graphs, Graphs, random sums, and sojourn time distributions, with application to ion-channel modeling, Diameter of parallelogramic honeycomb torus, A fast algorithm for minimum weight odd circuits and cuts in planar graphs, Remarks on the thickness and outerthickness of a graph, Probabilistic inference in multiply connected belief networks using loop cutsets, A note on locating a central vertex of a 3-cactus graph, Theory of 2-structures. I: Clans, basic subclasses, and morphisms, Primitivity is hereditary for 2-structures, Some bounds for the regular genus of PL-manifolds, Hamiltonicity of tree-like graphs, Finding Hamiltonian cycles in certain planar graphs, On two dual classes of planar graphs, Coloring certain proximity graphs, Region distributions of graph embeddings and Stirling numbers, Graph theoretic characterization and reliability of the multiple-clique network, Number synthesis of kinematic chains based on permutation groups, The chromaticity of wheels with a missing spoke, Tournament scoring problem, Approximation algorithms for partially covering with edges, Formula dissection: A parallel algorithm for constraint satisfaction, Solving the car sequencing problem via branch \& bound, Friendship decompositions of graphs, The linear 3-arboricity of \(K_{n,n}\) and \(K_n\), A multiplicative inequality for vertex Folkman numbers, Q-integral graphs with edge-degrees at most five, Shellable graphs and sequentially Cohen-Macaulay bipartite graphs, On cyclic edge-connectivity of fullerenes, Graph parameters measuring neighbourhoods in graphs-bounds and applications, Information processing in complex networks: Graph entropy and information functionals, A distance approximating trees, Using classical graph theory to generate non-isomorphic floorplan distributions in the measurement of egress complexity, Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs, A matrix method for computing Szeged and vertex PI indices of join and composition of graphs, A note on the pure Morse complex of a graph, On complexity of special maximum matchings constructing, Graphs associated to co-maximal ideals of commutative rings, Co-maximal graph of non-commutative rings, Ring graphs and complete intersection toric ideals, Inequalities for entropy-based measures of network information content, On the spectral radius of unicyclic graphs with prescribed degree sequence, 9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class, Treewidth computations. I: Upper bounds, A short constructive proof of the Erdős-Gallai characterization of graphic lists, On wreathed lexicographic products of graphs, An efficient approach for counting the number of spanning trees in circulant and related graphs, Additive edge labelings, A proof of unimodality on the numbers of connected spanning subgraphs in an \(n\)-vertex graph with at least \(\left\lceil (3-2\sqrt 2) n^2 + n - \frac {7-2\sqrt 2}{2 \sqrt 2}\right\rceil\) edges, On disjoint matchings in cubic graphs, Trees with minimal index and diameter at most four, Products of unit distance graphs, An algorithm for partitioning trees augmented with sibling edges, Some digraphs arising from number theory and remarks on the zero-divisor graph of the ring \(Z_n\), Global and robust formation-shape stabilization of relative sensing networks, Which digraphs with ring structure are essentially cyclic?, Cycle embedding of augmented cubes, An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation, On edge-disjoint pairs of matchings, Wiener index of graphs with more than one cut-vertex, The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications, Integer version of the multipath flow network synthesis problem, Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian graphs, Dynamics and stability of volume-scavenging drop arrays: Coarsening by capillarity, Characterization of a class of graphs related to pairs of disjoint matchings, Non-planar core reduction of graphs, A graph-theoretic perspective on the links-to-concepts ratio expected in cognitive maps, Investigating the existence and the regularity of logarithmic Harary graphs, Set colorings of graphs, Szeged index of \(TUC_4C_8(S)\) nanotubes, On self-clique graphs with given clique sizes. II, Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs, Undirected simple connected graphs with minimum number of spanning trees, Intersection models of weakly chordal graphs, The upper connected geodetic number and forcing connected geodetic number of a graph, A generalization of Lucas polynomial sequence, Minimum cuts, girth and a spectral threshold, Simplicial powers of graphs, Maximum induced subgraph of a recursive circulant, A classification of cubic \(s\)-regular graphs of order \(14p\), On the hamiltonicity of the Cartesian product, Strongly indexable graphs and applications, Linear-time certifying algorithms for near-graphical sequences, Partitioning graphs into complete and empty graphs, Uniformly optimal graphs in some classes of graphs with node failures, Minimum neighborhood in a generalized cube, Global-stability problem for coupled systems of differential equations on networks, Unique eccentric point graphs, Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences, Cobordant crystallizations, Characterizations of strongly chordal graphs, On qualitatively independent partitions and related problems, Size Ramsey numbers involving stars, Recursive descent parsing using implementation languages requiring definition before use, The number of rounds needed to exchange information within a graph, Dynamic cycle detection, On powers and centers of chordal graphs, An algebraic theory of graph factorization, Solutions of some further graph equations, The 1-factorization of some line-graphs, Efficient bounds for the stable set, vertex cover and set packing problems, Hamiltonian cycles and paths in vertex-transitive graphs with abelian and nilpotent groups, On the use of senders in generalized Ramsey theory for graphs, Some properties of a multidigraph by semi-incidence matrices, The minimal trivalent graphs with given smallest odd cycle, A note on the complexity of finding regular subgraphs, Construction d'une famille de codes associés à certains groupes finis. (Construction of a family of codes associated to certain finite groups), All Ramsey numbers for five vertices and seven or eight edges, Edge-coloured complete graphs: Connectedness of some subgraphs, Reconstructing ancestral character states under Wagner parsimony, Triad count statistics, The relationship between the Jacobi and the successive overrelaxation (SOR) matrices of a k-cyclic matrix, Relational decomposition and structural analysis of systems, Centering a spanning tree of a biconnected graph, The binding number of Halin 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, Proving phylogenetic trees minimal with l-clustering and set partitioning, On the complexity of computing bilinear forms with \(\{0,1\}\) constants, Linear algorithms to recognize outerplanar and maximal outerplanar graphs, The smallest graphs with certain adjacency properties, Edge cosymmetric graphs, A note on path-perfect graphs, Contraction theorems in Hamiltonian graph theory, Matrices of zeros and ones with fixed row and column sum vectors, On the complexity of testing a graph for n-cube, Geography, games and graphs, On the coverings of graphs, Comparison of phylogenetic trees, How well can a graph be n-colored?, Paths in r-partite self-complementary graphs, r-partite self-complementary graphs-diameters, Graph theoretic models, Dual imbeddings and wrapped quasi-coverings of graphs, Realization of certain generalized paths in tournaments, Regular separable graphs of minimum order with given diameter, On time graphs, On the spectrum of a complete multipartite graph, Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity, The enumeration of graphical partitions, More star sub-Ramsey numbers, Ramsey-minimal graphs for star-forests, Matrices with isomorphic diagonal hypergraphs, Sequential and cellular graph automata, A note on odd and even factors of undirected graphs, Generalized 1-factorization of trees, On vertex symmetric digraphs, Algorithmic proofs of two relations between connectivity and the 1- factors of a graph, A remark on Hamiltonian cycles, High density graphs for processor interconnection, Further results on graph equations for line graphs and \(n\)-th power graphs, Oriented two-dimensional circuits, Colorings and interpretations: a connection between graphs and grammar forms, Counting unrooted planar maps, On the permanents of complements of the direct sum of identity matrices, On the maximum number of diagonals of a circuit in a graph, Characterization of unigraphic and unidigraphic integer-pair sequences, Reductions of the graph reconstruction conjecture, Graphs which, with their complements, have certain clique covering numbers, On the reconstruction of separable graphs from elementary contractions, Robustness of BIBD against the unavailability of data, On minimal graphs, Complexity of representation of graphs by set systems, Permanental polynomials of graphs, Optimal assignment of broadcasting frequencies, When m vertices in a k-connected graph cannot be walked round along a simple cycle, Complements of Steinhaus graphs, Boolean distance for graphs, Tree counting polynomials for labelled graphs. I: Properties, On the complexity of edge labelings for trees, Receptor clustering on a cell surface. III. Theory of receptor cross- linking by multivalent ligands: Description by ligand states, Characterisation of potentially bipartite self-complementary bipartitioned sequences, Treediagonal matrices and their inverses, Uniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphs, D-optimal block designs with at most six varieties, Color-families are dense, On the radius of graphs, On k-path Hamiltonian maximal planar graphs, Initial value adjusting method and graph theoretical analysis for the solution of nonlinear multipoint boundary value problems with varying system dimensions, Some results on conversion matrices, Multicolor Ramsey numbers involving graphs with long suspended paths, Graphs isomorphic to subgraphs of their line-graphs, On the relationship between the biconnectivity augmentation and traveling salesman problems, On the characteristic polynomial of the adjacency matrix of the subdivision graph of a graph, Ramsey-minimal graphs for forests, The Steiner problem in phylogeny is NP-complete, Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time, Intersection graphs of k-uniform linear hypergraphs, The analysis of semigroups of multirelational systems, An algorithm for finding optimum path in networks, A graph theoretic approach to switching function minimization, Improvement on Brooks' chromatic bound for a class of graphs, Graphs with eigenvalues at least - 2, On maximally saturated graphs, Proof of Harary's conjecture on the reconstruction of trees, The edge Hamiltonian path problem is NP-complete, Connected graphs switching equivalent to their iterated line graphs, A simple algorithm to detect balance in signed graphs, Strongly regular graphs and finite Ramsey theory, Extremal regular graphs for the achromatic number, Construction of ergodic transformations, R-domination of block graphs, On the Ramsey multiplicity for stars, Construction of matroidal families by partly closed sets, Minimum number of edges in graphs that are both \(P_ 2-\) and \(P_ i- \)connected, 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, 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, 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, On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs, Locating an absolute center on graphs that are almost trees, Chromatic partitions of a graph, A linear time algorithm for longest (s,t)-paths in weighted outerplanar graphs, 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, 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, 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, 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, Perfect edge domination and efficient edge domination in graphs, A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees, On the number of rainbow spanning trees in edge-colored complete graphs, The second generalized Hamming weight of some evaluation codes arising from a projective torus, A note on co-maximal graphs of commutative rings, Phase transitions in stochastic non-linear threshold Boolean automata networks on \(\mathbb{Z}^2\): the boundary impact, Carousel greedy: a generalized greedy algorithm with applications in optimization, 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, The bivariate quadratic \(C^1\) spline spaces with stable dimensions on the triangulations, On chromatic sums and distributed resource allocation, Systematic evaluation of a new combinatorial curvature for complex networks, On total directed graphs of non-commutative rings, Higher order assortativity in complex networks, 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., A Krasnosel'skii-type theorem for an enlarged class of orthogonal polytopes, 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., Twin subgraphs and core-semiperiphery-periphery structures, Uncertainty measure on fuzzy partitions., On line graphs with maximum energy, Light paths and edges in families of outer-1-planar graphs, Distance-hereditary comparability 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, 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, 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, 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, An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem, 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 combinatorial structures of line drawings of polyhedra, On regular and strongly-regular self-complementary graphs, A recursive characterization of the 4-connected graphs, Scheduling of independent jobs in star graph networks, Bipartite graphs whose edge algebras are complete intersections, A construction of thickness-minimal graphs, ``Global graph problems tend to be intractable, Facilities layout generalized model solved by n-boundary shortest path heuristics, Maximum-length sequences, cellular automata, and random numbers, Sperner properties for groups and relations, Representing branched coverings by edge-coloured graphs, The subchromatic number of a graph, M-chain graphs of posets, Subgraph isomorphism for biconnected outerplanar graphs in cubic time, On the orderability problem for PLA folding, A characterization of level planar graphs, Connectivity and edge-disjoint spanning trees, On the smallest graph of girth 10 and valency 3, Uniqueness and faithfulness of embedding of toroidal graphs, Lattice-based similarity measures between ordered trees, On the NP-hardness of edge-deletion and -contraction problems, An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs, Integer-pair sequences with self-complementary realizations, On clique covers and independence numbers of 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, Graphs constructible from cycles and complete graphs, 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, Graph theoretic analysis of PLA folding heuristics, On certain Hamiltonian inner triangulations, Independent domination in hypercubes, The irregularity cost or sum of a graph, A note on minimal matching covered graphs, On trees with a maximum proper partial 0-1 coloring containing a maximum matching, Computing the bipartite edge frustration of fullerene graphs, Hamiltonian paths with prescribed edges in hypercubes, A pegging approach to the precedence-constrained knapsack problem, Efficient algorithms for center problems in cactus networks, Comparing large graphs efficiently by margins of feature vectors, On the null-spaces of acyclic and unicyclic singular graphs, On the vertex arboricity of planar graphs of diameter two, Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs, On the cardinality of a factor set of binary matrices, Complex networks: structure and dynamics, General sum-connectivity index, general product-connectivity index, general Zagreb index and coindices of line graph of subdivision graphs, Modeling group assessments by means of hesitant fuzzy linguistic term sets, \(C\)-cordial labeling in signed graphs, Degree exponent polynomial of graphs obtained by some graph operations, Some results on the Laplacian spectra of graphs with pockets, Structure of wheel-trees with colourings and domination numbers, Line signed graph of a signed total graph, Adjacency matrix of a semigraph, Minimum geodetic fuzzy subgraph, Unitary Cayley meet signed graphs, On the metric dimension of join of a graph with empty graph(\(O_p\)), Vertex equitable labeling of signed graphs, \(\mathcal{C}\)-consistent and \(\mathcal{C}\)-cycle compatible dot-line signed graphs, On co-maximal meet signed graphs of commutative rings, Signed zero-divisor graph, Directed graphical structure, Nash equilibrium, and potential games, Panpositionable hamiltonicity and panconnectivity of the arrangement graphs, Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices, Tree polynomials and non-associative Gröbner bases, A fast diagnosis algorithm for locally twisted cube multiprocessor systems under the MM\(^{*}\) model, A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model, The globally bi-\(3^{*}\)-connected property of the honeycomb rectangular torus, Double graphs, On the index of caterpillars, Decomposition of Smith graphs in maximal reflexive cacti, \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs, The \(L(2,1)\)-labeling on graphs and the frequency assignment problem, A comparative analysis of multidimensional features of objects resembling sets of graphs, The crossing number of \(K_{1,4,n}\), A graphical construction of the D-optimal saturated, \(3\times s^{2}\) main effect, factorial design, On 3-regular 4-ordered graphs, Multicyclic treelike reflexive graphs, Spectra and energies of iterated line graphs of regular graphs, Numerical solution of the reaction-advection-diffusion equation on the sphere, Soliton propagation on chains with simple nonlocal defects, A \(q\)-analogue of the distance matrix of a tree, Some results on the index of unicyclic graphs, Cubic planar Hamiltonian graphs of various types, On the characterization of the domination of a diameter-constrained network reliability model, The crossing number of \(P(3,1)\times P_{n}\), General balance and treatment permutations, A lower bound on the size of \(k\)-neighborhood in generalized cubes, A contract-based model for directed network formation, Structure of digraphs associated with quadratic congruences with composite moduli, Contrast in greyscales of 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, Global dynamics of a general class of multi-group epidemic models with latency and relapse, Characterization of the finite C-MH-homogeneous graphs, Some corollaries of a theorem of Whitney on the chromatic polynomial, When the maximal graph is planar, outerplanar, and ring graph, Finite \(\{0,s,2s\}\)-affine linear spaces, A context-free language for binary multinomial processing tree models, Secure vertex cover of a graph, Spectra of the generalized edge corona of graphs, Dominating cliques in graphs, On integral sum graphs, Combinatorial reciprocity theorems, Hard graphs for the maximum clique problem, Connectivity of iterated line graphs, Completions of P-matrix patterns, On signed digraphs with all cycles negative, 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, On pure structure of dynamic systems, 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, Some distance magic graphs, 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, Energy of line graphs, 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 the line graphs of zero-divisor graphs of posets
Cites Work
