article

The maximum k-colorable subgraph problem for chordal graphs

Authors:

Mihalis Yannakakis,

Fanica GavrilAuthors Info & Claims

Information Processing Letters, Volume 24, Issue 2

Pages 133 - 137

https://doi.org/10.1016/0020-0190(87)90107-4

Published: 30 January 1987 Publication History

Abstract

No abstract available.

Cited By

View all

DeHaan IFriggstad Z(2023)Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal GraphsAlgorithms and Data Structures10.1007/978-3-031-38906-1_22(326-339)Online publication date: 31-Jul-2023
https://dl.acm.org/doi/10.1007/978-3-031-38906-1_22
Baxter AKeskinocak PSingh M(2022)Heterogeneous Multi-resource Allocation with Subset Demand RequestsINFORMS Journal on Computing10.1287/ijoc.2022.120434:5(2389-2399)Online publication date: 1-Sep-2022
https://dl.acm.org/doi/10.1287/ijoc.2022.1204
Kuryatnikova OSotirov RVera J(2022)The Maximum k-Colorable Subgraph Problem and Related ProblemsINFORMS Journal on Computing10.1287/ijoc.2021.108634:1(656-669)Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1287/ijoc.2021.1086
Show More Cited By

Index Terms

The maximum k-colorable subgraph problem for chordal graphs
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms
2. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs

A k -colouring of a graph G =( V , E ) is a mapping c : V {1,2, , k } such that c ( u ) c ( v ) whenever uv is an edge. The reconfiguration graph of the k -colourings of G contains as its vertex set the k -colourings of G , and two ...
The maximumk-colorable subgraph problem
Well-partitioned chordal graphs
Abstract
We introduce a new subclass of chordal graphs that generalizes the class of split graphs, which we call well-partitioned chordal graphs. A connected graph G is a well-partitioned chordal graph if there exist a partition P of the vertex ...

Comments

Information & Contributors

Information

Published In

Information Processing Letters Volume 24, Issue 2

January 1987

61 pages

ISSN:0020-0190

Editor:
A. V. Aho
AT&T Bell Laboratories, Murray Hill, NJ

Issue’s Table of Contents

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 30 January 1987

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

55
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

DeHaan IFriggstad Z(2023)Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal GraphsAlgorithms and Data Structures10.1007/978-3-031-38906-1_22(326-339)Online publication date: 31-Jul-2023
https://dl.acm.org/doi/10.1007/978-3-031-38906-1_22
Baxter AKeskinocak PSingh M(2022)Heterogeneous Multi-resource Allocation with Subset Demand RequestsINFORMS Journal on Computing10.1287/ijoc.2022.120434:5(2389-2399)Online publication date: 1-Sep-2022
https://dl.acm.org/doi/10.1287/ijoc.2022.1204
Kuryatnikova OSotirov RVera J(2022)The Maximum k-Colorable Subgraph Problem and Related ProblemsINFORMS Journal on Computing10.1287/ijoc.2021.108634:1(656-669)Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1287/ijoc.2021.1086
Quintero RBernal DTerlaky TZuluaga L(2022)Characterization of QUBO reformulations for the maximum k-colorable subgraph problemQuantum Information Processing10.1007/s11128-022-03421-z21:3Online publication date: 1-Mar-2022
https://dl.acm.org/doi/10.1007/s11128-022-03421-z
Chiarelli NKrnc MMilanič MPferschy UPivač NSchauer J(2022)Fair Allocation of Indivisible Items with Conflict GraphsAlgorithmica10.1007/s00453-022-01079-885:5(1459-1489)Online publication date: 12-Dec-2022
https://dl.acm.org/doi/10.1007/s00453-022-01079-8
Bai TXiao M(2022)Exact and Parameterized Algorithms for Restricted Subset Feedback Vertex Set in Chordal GraphsTheory and Applications of Models of Computation10.1007/978-3-031-20350-3_20(249-261)Online publication date: 16-Sep-2022
https://dl.acm.org/doi/10.1007/978-3-031-20350-3_20
Emek YKutten SShalom MZaks S(2021)Multicast Communications with Varying Bandwidth ConstraintsIEEE INFOCOM 2021 - IEEE Conference on Computer Communications10.1109/INFOCOM42981.2021.9488869(1-10)Online publication date: 10-May-2021
https://dl.acm.org/doi/10.1109/INFOCOM42981.2021.9488869
Choi JCabello SAhn H(2021)Maximizing Dominance in the Plane and its ApplicationsAlgorithmica10.1007/s00453-021-00863-283:11(3491-3513)Online publication date: 1-Nov-2021
https://dl.acm.org/doi/10.1007/s00453-021-00863-2
Subramanian C(2020)Inductive Graph Invariants and Algorithmic ApplicationsCombinatorial Optimization and Applications10.1007/978-3-030-64843-5_53(780-801)Online publication date: 11-Dec-2020
https://dl.acm.org/doi/10.1007/978-3-030-64843-5_53
Ito TOtachi Y(2019)Reconfiguration of colorable sets in classes of perfect graphsTheoretical Computer Science10.1016/j.tcs.2018.11.024772:C(111-122)Online publication date: 7-Jun-2019
https://dl.acm.org/doi/10.1016/j.tcs.2018.11.024
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs

The maximumk-colorable subgraph problem

Well-partitioned chordal graphs

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations