Co-2-plex vertex partitions
From MaRDI portal
Publication:498448
DOI10.1007/s10878-013-9664-2zbMath1331.90090OpenAlexW1983306570MaRDI QIDQ498448
John D. Arellano, Benjamin McClosky, Illya V. Hicks
Publication date: 28 September 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-013-9664-2
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial algorithms for the maximum \(k\)-plex problem
- The \(t\)-stability number of a random graph
- An algorithm for finding a maximum clique in a graph
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes
- A note on generalized chromatic number and generalized girth
- Defective coloring revisited
- Graph Theory and Probability
- The t-improper chromatic number of random graphs
- The Co-2-plex Polytope and Integral Systems
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- A graph‐theoretic generalization of the clique concept
- New methods to color the vertices of a graph
- An algorithm for the chromatic number of a graph
- Chromatic Scheduling and the Chromatic Number Problem
This page was built for publication: Co-2-plex vertex partitions