The number of caterpillars
From MaRDI portal
Publication:2562091
DOI10.1016/0012-365X(73)90067-8zbMATH Open0266.05102OpenAlexW2096481849MaRDI QIDQ2562091FDOQ2562091
Allen J. Schwenk, Frank Harary
Publication date: 1973
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(73)90067-8
Cites Work
Cited In (46)
- MAXIMAL OUTERPLANE GRAPHS WITH TWO SIMPLICIAL VERTICES
- Block-indifference graphs: characterization, structural and spectral properties
- On a novel eccentricity-based invariant of a graph
- On domination game stable graphs and domination game edge-critical graphs
- Title not available (Why is that?)
- Deriving graphs with a retracting-free bidirectional double tracing
- On \(m\)-closed graphs
- On the smallest sets blocking simple perfect matchings in a convex geometric graph
- Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars
- Pentagonal chains and annuli as models for designing nanostructures from cages
- Log-concavity of some independence polynomials via a partial ordering
- Blockers for simple Hamiltonian paths in convex geometric graphs of even order
- Leaf realization problem, caterpillar graphs and prefix normal words
- Isolated Rupture in Thorny Networks
- Sum graphs over all the integers
- The Gini index of random trees with an application to caterpillars
- The color cost of a caterpillar
- On two eccentricity-based topological indices of graphs
- Schur reduction of trees and extremal entries of the Fiedler vector
- Spanning multi-paths in hypercubes
- On Mostar and edge Mostar indices of graphs
- THE DEGREE PROFILE AND GINI INDEX OF RANDOM CATERPILLAR TREES
- The maximum linear arrangement problem for trees under projectivity and planarity
- Extreme values of the Fiedler vector on trees
- Reciprocal best match graphs
- Pairwise Compatibility Graphs: A Survey
- Blockers for simple Hamiltonian paths in convex geometric graphs of odd order
- 2-chains: An interesting family of posets
- Burning number of caterpillars
- A study of maximum unit-circle caterpillars---tools for the study of the shape of adsorption patterns
- One node fault tolerance for caterpillars and starlike trees
- Embedding ladders and caterpillars into the hypercube
- The proportion of trees that are linear
- Alpha graphs with different pendent paths
- On multiplicities of eigenvalues of a spectral problem on a prolate tree
- On convex geometric graphs with no \(k+1\) pairwise disjoint edges
- Characterization of co-blockers for simple perfect matchings in a convex geometric graph
- Clique-perfectness of complements of line graphs
- Maximal independent sets in a generalisation of caterpillar graph
- Convex dominating sets in maximal outerplanar graphs
- On chromatic Zagreb indices of certain graphs
- A new sum of graphs and caterpillar trees
- Blockers for triangulations of a convex polygon and a geometric maker-breaker game
- On the burning number of \(p\)-caterpillars
- Graphs, partitions and Fibonacci numbers
- Resistance distance and spanning 2-forest matrices of linear 2-trees
This page was built for publication: The number of caterpillars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2562091)
