scientific article; zbMATH DE number 3290993
From MaRDI portal
Publication:5572939
zbMATH Open0182.57702MaRDI QIDQ5572939FDOQ5572939
Authors: Frank Harary 
Publication date: 1969
Title of this publication is not available (Why is that?)
Recommendations
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05Cxx)
Cited In (only showing first 100 items - show all)
- The square of a block is strongly path connected
- Layered graphs: applications and algorithms
- Path-star Ramsey numbers
- Bounds on the bend number of split and cocomparability graphs
- The chromatic polynomial between graph \& its complement---about Akiyama and Harary's open problem
- Title not available (Why is that?)
- A theory of Cartesian product and factorization of circulant graphs
- On Ramsey Type Problems in Combinatorial Geometry
- Block graph of a graph
- Almost self-centered graphs
- Note on the subgraph component polynomial
- Equivalence between hypergraph convexities
- Independence in graphs with maximum degree four
- A note on polyomino chains with extremum general sum-connectivity index
- A note on the adversary degree associated reconstruction number of graphs
- Roots of Ehrhart polynomials arising from graphs
- A STUDY ON EQUITABLE CHROMATIC AND THRESHOLD OF MYCIELSKIAN OF GRAPHS
- An algorithm for generating a family of alternating knots
- Region distributions of some small diameter graphs
- The strongest monotone degree condition for \(n\)-connectedness of a graph
- Combinatorial approach to group hierarchy for stereoskeletons of ligancy 4
- On graphical partitions
- Independent point-set dominating sets in graphs
- The connected monophonic number of a graph
- On 1-factorizability of Cayley graphs
- On group chromatic number of graphs
- Graphs with forbidden subgraphs
- Hereditary properties of raphs
- Some general constructions of geodetic blocks
- On cubical graphs
- On the number of 1-factorizations of the complete graph
- Hajos' graph-coloring conjecture: Variations and counterexamples
- Soldering and point splitting
- Communication and energy efficient routing protocols for single-hop radio networks
- Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract)
- Decomposition of a hypergraph by partial-edge separators
- Strongly self-complementary and hereditarily isomorphic tournaments
- Polynomially-bounded Dehn functions of groups
- Cayley graphs versus algebraic graphs
- Task-level approaches for the control of constrained multibody systems
- Dictators on blocks: Generalizations of social choice impossibility theorems
- Optimal algorithms for symmetry detection in two and three dimensions
- The splitting number of the complete graph
- On minimal elementary bipartite graphs
- Higmanian rank-5 association schemes on 40 points
- Independent sets in graphs
- Note on group distance magic graphs \(G[C_4]\)
- Dimer coverings on the Sierpinski gasket
- Fuzzy temporal characteristics of operations for project management on the network models basis
- New inequalities between information measures of network information content
- Enumerating stereo-isomers of tree-like polyinositols
- Large-scale analysis of structural branching measures
- Title not available (Why is that?)
- Residual reliability of P-threshold graphs
- A polynomial characterization of some graph partitioning problems
- Matching extension and the genus of a graph
- On the chromatic index of outerplanar graphs
- On the density of non-simple 3-planar graphs
- On the vertex connectivity of Deza graphs
- On the average genus of a graph
- Improved sufficient conditions for the existence of anti-directed Hamiltonian cycles in digraphs
- Semi-dynamic shortest paths and breadth-first search in digraphs
- Entire Harary index of graphs
- Classification of digital \(n\)-manifolds
- Maintaining centdians in a fully dynamic forest with top trees
- On \(b\)-chromatic number with other types of chromatic numbers on double star graphs
- The multiregional core-periphery model: the role of the spatial topology
- Links between maximum likelihood and maximum parsimony under a simple model of site substitution
- A Kuratowski-type theorem for the maximum genus of a graph
- Linear graph grammars: Power and complexity
- Generalised colouring sums of graphs
- Construction of finite p-groups with prescribed group of noncentral automorphisms
- Line domination in graphs
- Indecomposable Laplacian integral graphs
- Finiteness of a cohomology associated with certain Jackson integrals
- The architecture and the Jones polynomial of polyhedral links
- Title not available (Why is that?)
- Contextual hyperedge replacement
- Enumerating and indexing many-body intramolecular interactions: a graph theoretic approach
- Stationary nonlinear Schrödinger equation on simplest graphs
- The characteristic polynomial of a graph
- \(k\)-configurations
- On the evaluation of Matsubara sums
- Total domination polynomials of some splitting graphs
- An edge extremal result for subcohesion
- Polynomial time recognition of essential graphs having stability number equal to matching number
- A 0.5358-approximation for Bandpass-2
- Limit laws for the Randić index of random binary tree models
- Threshold Sequences
- The mathematics of spatial configuration: revisiting, revising and critiquing justified plan graph theory
- A large class of maximally tough graphs
- Exact algorithms for edge domination
- The square of a block is Hamiltonian connected
- Bigeodetic graphs
- Line perfect graphs
- On the number of complete subgraphs contained in certain graphs
- Vertex-vertex color energy of a graph
- Absolute planar retracts and the four colour conjecture
- An Optimal Diagonal Tree Code
- (1, 2)-DOUBLE DOMINATION IN GRAPHS
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5572939)
