Co-2-plex vertex partitions

DOI10.1007/S10878-013-9664-2MaRDI QIDQ498448zbMATH OpenOpenAlexFDO

Authors Benjamin McClosky, John D. Arellano, 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

zbMATH Keywords

co-2-plexindependence systems2-plexco-2-plex coloring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 2146626
• Vertex partitions of graphs into cographs and stars
• Partitions of graphs into cographs
• Co-2-plex polynomials
• Canonical Vertex Partitions
• scientific article; zbMATH DE number 524137
• Vertex partitions of chordal graphs
• Convex Partitions of Graphs
• The Co-2-plex Polytope and Integral Systems
• Convex \(p\)-partitions of bipartite graphs

Cites work

• scientific article; zbMATH DE number 3646931 (Why is no real title available?)
• scientific article; zbMATH DE number 3885934 (Why is no real title available?)
• scientific article; zbMATH DE number 4008419 (Why is no real title available?)
• scientific article; zbMATH DE number 2040957 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• scientific article; zbMATH DE number 3243267 (Why is no real title available?)
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• A graph‐theoretic generalization of the clique concept
• A note on generalized chromatic number and generalized girth
• An algorithm for finding a maximum clique in a graph
• An algorithm for the chromatic number of a graph
• Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes
• Chromatic Scheduling and the Chromatic Number Problem
• Combinatorial algorithms for the maximum \(k\)-plex problem
• Defective coloring revisited
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Graph Theory and Probability
• New methods to color the vertices of a graph
• The Co-2-plex Polytope and Integral Systems
• The \(t\)-stability number of a random graph
• The t-improper chromatic number of random graphs
• Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring

Cited in

(2)

• Maximum weight t-sparse set problem on vector-weighted graphs
• The Co-2-plex Polytope and Integral Systems

This page was built for publication: Co-2-plex vertex partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q498448)