On König graphs with respect to P4

详细

We describe the class of graphs whose every induced subgraph has the property: The maximum number of disjoint induced 4-paths is equal to the minimum size of the set of the vertices such that each 4-path contains at least one of them. The description is based on the operation of replacing vertices by cographs which is to the vertices of the graphs obtained from bipartite graphs by subdividing their cycle edges.