Parallel concepts in graph theory
From MaRDI portal
Publication:1324287
DOI10.1016/0895-7177(93)90061-3zbMATH Open0797.05064OpenAlexW2019588842MaRDI QIDQ1324287FDOQ1324287
Authors: Frank Harary 
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
Recommendations
Extremal problems in graph theory (05C35) Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Parallel concepts in graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- COVERING AND PACKING IN GRAPHS, I.
- Isomorphic Factorisations. I: Complete Graphs
- Isomorphic factorizations X: Unsolved problems
- Title not available (Why is that?)
- Node-graceful graphs
Cited In (only showing first 100 items - show all)
- Homomorphisms of derivative graphs
- Tough graphs and Hamiltonian circuits.
- Breaking symmetry in complete graphs by orienting edges: asymptotic bounds
- The recognition of geodetically connected graphs
- Finding and counting small induced subgraphs efficiently
- Path-based depth-first search for strong and biconnected components
- Recognizing cographs and threshold graphs through a classification of their edges
- Vertex coloring without large polychromatic stars
- On the skew energy of orientations of hypercubes
- The decomposition of graphs into \(k\)-connected components
- The Zagreb coindices of graph operations
- A table of connected graphs on six vertices
- Approximation algorithms for maximum two-dimensional pattern matching
- Old and new results on algebraic connectivity of graphs
- On the use of senders in generalized Ramsey theory for graphs
- The complexity of facets (and some facets of complexity)
- The hull number of a graph
- Exact coverings of 2-paths by Hamilton cycles
- On some counting polynomials in chemistry
- On products and line graphs of signed graphs, their eigenvalues and energy
- Network topology and the efficiency of equilibrium
- Graph with given achromatic number
- On a variation of the Oberwolfach problem
- On graphs whose graphoidal domination number is one
- Radio mean labeling of a graph
- The forcing vertex detour monophonic number of a graph
- \(k\)-Zumkeller labeling for twig graphs
- Further results on vertex equitable graphs
- Finite abelian group labeling
- Odd mean labeling of chain of graphs
- Odd harmonious labeling of some new families of graphs
- Some results on edge pair sum labeling
- Zero ring labeling of graphs
- Intersection graphs of cyclic subgroups of groups
- Restriction of simple games
- Infiltration games on arbitrary graphs
- On a graph partition problem with application to VLSI layout
- Q-integral graphs with edge-degrees at most five
- Some determinant expansions and the matrix-tree theorem
- Treewidth computations. I: Upper bounds
- A linear time algorithm for longest (s,t)-paths in weighted outerplanar graphs
- Eccentric graphs
- Obstruction set isolation for the gate matrix layout problem
- Endomorphism-regularity of split graphs
- Representing graphs implicitly using almost optimal space
- Sign patterns of matrices and their inverses
- Constant-time parallel recognition of split graphs
- New results about the bondage number of a graph
- Reconstructing ancestral character states under Wagner parsimony
- On chromatic sums and distributed resource allocation
- Hypohamiltonian and hypotraceable graphs
- Proving phylogenetic trees minimal with l-clustering and set partitioning
- The distribution of degrees in a large random tree
- Algorithms and obstructions for linear-width and related search parameters
- Bounding the bandwidths for graphs
- An efficient algorithm for solving the homogeneous set sandwich problem
- Integer version of the multipath flow network synthesis problem
- The facility layout problem
- Steiner problem in Halin networks
- On End-regular graphs
- The binding number of Halin graphs
- On finding minimal length superstrings
- On vertex symmetric digraphs
- Intersection graphs of k-uniform linear hypergraphs
- Derangements on the \(n\)-cube
- Extensions of coloring models for scheduling purposes
- Line graphs and forbidden induced subgraphs
- Analyzing cognitive maps to help structure issues or problems
- On the hull sets and hull number of the Cartesian product of graphs
- Cobordant crystallizations
- Unique eccentric point graphs
- Large minimal sets which force arithmetic progressions
- Some models of graphs for scheduling sports competitions
- The subgraph homeomorphism problem for small wheels
- A modular approach to Sprouts
- Geography, games and graphs
- On the relationship between the biconnectivity augmentation and traveling salesman problems
- Unimodular equivalence of graphs
- An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree
- Spanning trees on hypercubic lattices and nonorientable surfaces
- Planar and infinite hypohamiltonian and hypotraceable graphs
- The largest small hexagon
- A method in graph theory
- On recognizing graph properties from adjacency matrices
- The dependence graph for bases in matroids
- A Turan type problem for interval graphs
- Perfect edge domination and efficient edge domination in graphs
- The total coloring of a multigraph with maximal degree 4
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- The geodetic number of a graph
- Embedding ladders and caterpillars into the hypercube
- A recursive characterization of the 4-connected graphs
- The crossing number of \(C(n; \{1,3\})\)
- Cutting down recursive trees
- Generalized Latin squares. II
- On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs
- The square of every two-connected graph is Hamiltonian
- A contract-based model for directed network formation
- Large cycles in graphs
- Global dynamics of a general class of multi-group epidemic models with latency and relapse
This page was built for publication: Parallel concepts in graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1324287)
