Minimal obstructions to 2-polar cographs
Discrete Applied Mathematics（2019）
摘要
A graph is a cograph if it is P4-free. A k-polar partition of a graph G is a partition of the set of vertices of H into parts A and B such that the subgraph induced by A is a complete multipartite graph with at most k parts, and the subgraph induced by B is a disjoint union of at most k cliques with no other edges.
更多查看译文
关键词
Polar graph,Cograph,Forbidden subgraph characterization,k-polar graph,Matrix partition,Generalized coloring
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要