scientific article; zbMATH DE number 6813595
From MaRDI portal
Publication:4595189
zbMath1375.05140MaRDI QIDQ4595189
Publication date: 29 November 2017
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/67/ajc_v67_p281.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Connectivity (05C40)
Related Items (4)
On the number of connected sets in bounded degree graphs ⋮ The average size of a connected vertex set of a graph—Explicit formulas and open problems ⋮ The number and average size of connected sets in graphs with degree constraints ⋮ Extremal problems for connected set enumeration
This page was built for publication: