On the number of connected sets in bounded degree graphs
From MaRDI portal
Publication:1627210
zbMath1402.05039MaRDI QIDQ1627210
Kustaa Kangas, Petteri Kaski, Janne H. Korhonen, Mikko Koivisto
Publication date: 22 November 2018
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i4p34
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Connectivity (05C40) Vertex degrees (05C07)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumerating minimal connected dominating sets in graphs of bounded chordality
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- An upper bound for the number of independent sets in regular graphs
- Some intersection theorems for ordered sets and graphs
- Independent sets in regular graphs and sum-free subsets of finite groups
- Enumeration and maximum number of minimal connected vertex covers in graphs
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
- Trimmed Moebius inversion and graphs of bounded degree
- On independent sets and bicliques in graphs
- An Entropy Approach to the Hard-Core Model on Bipartite Graphs
- On the Number of Connected Sets in Bounded Degree Graphs
- Finding Induced Subgraphs via Minimal Triangulations
- The traveling salesman problem in bounded degree graphs
- The Number of Independent Sets in a Regular Graph
- Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
- Improved Bounds for Minimal Feedback Vertex Sets in Tournaments
- On the number of minimal separators in graphs
- On the number of maximal bipartite subgraphs of a graph
- Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n
- Feedback Vertex Sets in Tournaments
- Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds
- Combinatorial bounds via measure and conquer
- On cliques in graphs
