Titlebook: ;

REIGN

量被毁坏

https://doi.org/10.1007/978-3-319-28275-6minimum number of independent sets, each of total size at most 1. Being a generalization of the notoriously hard graph coloring problem, BPC has been studied mostly on polynomially colorable conflict graphs. An intriguing open question is whether BPC on such graphs admits the same best known approxi

ADAGE

责难

,Reconstructing Graphs from Connected Triples, form a connected subgraph. In general, different (labelled) graphs may have the same set of connected triples, making unique reconstruction of the original graph from the triples impossible. We identify some families of graphs (including triangle-free graphs) for which all graphs have a different s

BIDE

,Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1,hwidth at most 1. The problem . (.) asks whether such a graph can be obtained using at most . vertex explosions, where a . replaces a vertex . by . degree-1 vertices, each incident to exactly one edge that was originally incident to .. For ., we give an FPT algorithm with running time . and an . ker

说不出

集中营

anthesis

,New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth,eter that is as general as possible and allows to solve independent set in polynomial-time on graphs where the parameter is bounded. We introduce two new graph width parameters: one-sided maximum induced matching-width (o-mim-width) and neighbor-depth. O-mim-width is a graph parameter that is more g

macrophage

,Nonplanar Graph Drawings with , Vertices per Face,n increasing attention in the last two decades, under the name of .. In this context, we introduce a new hierarchy of graph families, called .-.. For any integer ., a graph . is a .-real face graph if it admits a drawing . in the plane such that the boundary of each face (formed by vertices, crossin

etiquette