Regular independent sets

DOI10.1016/j.dam.2015.09.020zbMath1332.05104arXiv1306.5026OpenAlexW1911099624MaRDI QIDQ260019

Ryan Pepper, Adriana Hansberg, Yair Caro

Publication date: 18 March 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.5026

zbMATH Keywords

independenceplanar graphs\(k\)-degenerate graphs\(k\)-independence\(k\)-treesregular independence

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Related Items

Large induced subgraphs with three repeated degrees ⋮ Upper bounds on the \(k\)-forcing number of a graph ⋮ Irregular independence and irregular domination ⋮ Equating two maximum degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Fair domination in graphs
• Repetition number of graphs
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• Geometric algorithms and combinatorial optimization
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Lower bounds for constant degree independent sets
• Bounded-degree independent sets in planar graphs
• Face covers and the genus problem for apex graphs
• New approach to the \(k\)-independence number of a graph
• Linear time solvable optimization problems on graphs of bounded clique-width
• On \(k\)-domination and \(j\)-independence in graphs
• Large induced forests in sparse graphs
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Deciding Clique-Width for Graphs of Bounded Tree-Width
• On the Relationship Between Clique-Width and Treewidth
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Regular independent sets