Pages that link to "Item:Q933684"
From MaRDI portal
The following pages link to Corrigendum to ``Counting connected graphs inside-out'' [J. Comb. Theory, Ser. B 93, No. 2, 127--172 (2005; Zbl 1057.05044)] (Q933684):
Displaying 12 items.
- Corrigendum to ``On the approximability and hardness of minimum topic connected overlay and its special instances'' (Q476920) (← links)
- Corrigendum to ``Factoring, into edge transpositions of a tree, permutations fixing a terminal vertex'' [J. Comb. Theory, Ser. A 85, No.\,1, 92--95 (1999; Zbl 0940.05038)] (Q618323) (← links)
- Corrigendum to: ``The effect on eigenvalues of connected graphs by adding edges'' (Q1654424) (← links)
- Corrigendum to: ``The orthogonal colouring game'' (Q2006785) (← links)
- Corrigendum to: ``Bounds on the number of edges of edge-minimal, edge-maximal and \(l\)-hypertrees'' (Q2062690) (← links)
- Corrigendum to ``Completeness results for graph isomorphism'' (Q2495413) (← links)
- Counting strongly-connected, moderately sparse directed graphs (Q2844082) (← links)
- Corrigendum to secret sharing on infinite graphs (Q3075871) (← links)
- Corrigendum to ``"On the enumeration of a class of toroidal graphs" [Contrib. Discrete Math. 13 (2018), no. 1, 79-119] (Q3303512) (← links)
- Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401-439 (Q3619616) (← links)
- Corrigendum to: ``Log-concavity of some independence polynomials via a partial ordering'' (Q6080562) (← links)
- Correction to: ``Sandwiching dense random regular graphs between binomial random graphs'' (Q6095845) (← links)
