Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
2-trees
Description:
A 2-tree is a graph formed from a triangle by repeatedly adding vertices adjacent to both endpoints of an existing edge, studied in graph theory.
Primary topic:
Advanced Graph Theory Research (45%)
Related topics:
Advanced Graph Theory Research (45%),
Complexity and Algorithms in Graphs (11%),
Advanced Combinatorial Mathematics (9%),
Graph theory and applications (7%)
OpenAlex ID:
keywords/2-trees
Steiner trees, partial 2–trees, and minimum IFI networks
1983
·
Joseph A. Wald
, Charles J. Colbourn
·
Networks
·
229
The chromatic number of oriented graphs
1997
·
Eric Sopena
·
Journal of Graph Theory
·
152
Drawings of planar graphs with few slopes and segments
2006
·
Vida Dujmović
, David Eppstein
, et al.
·
Computational Geometry
·
99
The solution of passive electrical networks by means of mathematical trees
1953
·
W.S. Percival
·
Proceedings of the IEE - Part III Radio and Communication Engineering
·
77
Stack and queue number of 2-trees
1995
·
S. Rengarajan
, C. E. Veni Madhavan
·
Lecture notes in computer science
·
68
Matching preclusion and conditional matching preclusion for regular interconnection networks
2012
·
Eddie Cheng
, Marc J. Lipman
, et al.
·
Discrete Applied Mathematics
·
67
Matching Preclusion for Alternating Group Graphs and Their Generalizations
2008
·
EDDIE CHENG
, LINDA LESNIAK
, et al.
·
International Journal of Foundations of Computer Science
·
59
Generation of Trees, Two-Trees, and Storage of Master Forests
1968
·
J. Char
·
IEEE Transactions on Circuit Theory
·
57
On the Queue-Number of Graphs with Bounded Tree-Width
2017
·
Veit Wiechert
·
The Electronic Journal of Combinatorics
·
52
Efficient algorithms for reliability analysis of distributed computing systems
1999
·
M Lin
·
Information Sciences
·
45
Networks immune to isolated failures
1981
·
Arthur M. Farley
·
Networks
·
44
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
2011
·
Eddie Cheng
, László Lipták
, et al.
·
Information Sciences
·
43
Nonempty intersection of longest paths in series–parallel graphs
2016
·
Guantao Chen
, Julia Ehrenmüller
, et al.
·
Discrete Mathematics
·
40
Orthogonal representations, minimum rank, and graph complements
2008
·
Leslie Hogben
·
Linear Algebra and its Applications
·
39
PDF
Generation and Realization of Trees and k-Trees
1964
·
S. Hakimi
, D. Green
·
IEEE Transactions on Circuit Theory
·
38
The computational complexity of the reliability problem on distributed systems
1997
·
Min-Sheng Lin
, Deng-Jyi Chen
·
Information Processing Letters
·
36
The Specification of 2-trees
2002
·
Tom Fowler
, Ira Gessel
, et al.
·
Advances in Applied Mathematics
·
35
A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments
1998
·
Jurek Czyzowicz
, Evangelos Kranakis
, et al.
·
Information Processing Letters
·
33
Intersecting longest paths
2013
·
Susanna F. de Rezende
, Cristina G. Fernandes
, et al.
·
Discrete Mathematics
·
32
PDF
Tree polytope on 2-trees
1994
·
F. Margot
, A. Prodon
, et al.
·
Mathematical Programming
·
32
Strong local diagnosability of -star graphs and Cayley graphs generated by 2-trees with missing edges
2013
·
Eddie Cheng
, László Lipták
, et al.
·
Information Processing Letters
·
31
Connected domination game
2018
·
Mieczysław Borowiecki
, Anna Fiedorowicz
, et al.
·
Applicable Analysis and Discrete Mathematics
·
26
PDF
A linear time algorithm for computing the most reliable source on a series-parallel graph with unreliable edges
1998
·
Charles J. Colbourn
, Guoliang Xue
·
Theoretical Computer Science
·
26
PDF
Pseudo-median graphs: decomposition via amalgamation and Cartesian multiplication
1991
·
Hans-Jürgen Bandelt
, Henry Martyn Mulder
·
Discrete Mathematics
·
26
Centers of 2–Trees
1980
·
Andrzej Proskurowski
·
Annals of discrete mathematics
·
26
Show more works
View as search
Works count:
212
Citation count:
2,168
Year
Topic
Type