Matches in SemOpenAlex for { <https://semopenalex.org/work/W4280652960> ?p ?o ?g. }
- W4280652960 endingPage "112985" @default.
- W4280652960 startingPage "112985" @default.
- W4280652960 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 set of G into cliques and a tree T having P as a vertex set such that for distinct X,Y∈P, (1) the edges between X and Y in G form a complete bipartite subgraph whose parts are some subsets of X and Y, if X and Y are adjacent in T, and (2) there are no edges between X and Y in G otherwise. A split graph with vertex partition (C,I) where C is a clique and I is an independent set is a well-partitioned chordal graph as witnessed by a star T having C as the center and each vertex in I as a leaf, viewed as a clique of size 1. We characterize well-partitioned chordal graphs by forbidden induced subgraphs, and give a polynomial-time algorithm that given a graph, either finds an obstruction, or outputs a partition of its vertex set that asserts that the graph is well-partitioned chordal. We observe that there are problems, for instance Densest k-Subgraph and b-Coloring, that are polynomial-time solvable on split graphs but become NP -hard on well-partitioned chordal graphs. On the other hand, we show that the Geodetic Set problem, known to be NP -hard on chordal graphs, can be solved in polynomial time on well-partitioned chordal graphs. We also answer two combinatorial questions on well-partitioned chordal graphs that are open on chordal graphs, namely that each well-partitioned chordal graph admits a polynomial-time constructible tree 3-spanner, and that each (2-connected) well-partitioned chordal graph has a vertex that intersects all its longest paths (cycles)." @default.
- W4280652960 created "2022-05-22" @default.
- W4280652960 creator A5020364299 @default.
- W4280652960 creator A5039626432 @default.
- W4280652960 creator A5041792622 @default.
- W4280652960 creator A5091558578 @default.
- W4280652960 date "2022-10-01" @default.
- W4280652960 modified "2023-10-05" @default.
- W4280652960 title "Well-partitioned chordal graphs" @default.
- W4280652960 cites W1512588309 @default.
- W4280652960 cites W1570138350 @default.
- W4280652960 cites W1579049696 @default.
- W4280652960 cites W1966935039 @default.
- W4280652960 cites W1969478787 @default.
- W4280652960 cites W1978452004 @default.
- W4280652960 cites W1984394682 @default.
- W4280652960 cites W1988646256 @default.
- W4280652960 cites W2002041206 @default.
- W4280652960 cites W2006278018 @default.
- W4280652960 cites W2015208587 @default.
- W4280652960 cites W2038715674 @default.
- W4280652960 cites W2041746306 @default.
- W4280652960 cites W2045824107 @default.
- W4280652960 cites W2069409708 @default.
- W4280652960 cites W2073043470 @default.
- W4280652960 cites W2074999464 @default.
- W4280652960 cites W2078153212 @default.
- W4280652960 cites W2086119402 @default.
- W4280652960 cites W2089465933 @default.
- W4280652960 cites W2110486245 @default.
- W4280652960 cites W2116087731 @default.
- W4280652960 cites W2124568589 @default.
- W4280652960 cites W2132624129 @default.
- W4280652960 cites W2169648807 @default.
- W4280652960 cites W2172129783 @default.
- W4280652960 cites W2179374792 @default.
- W4280652960 cites W2531095544 @default.
- W4280652960 cites W2569520194 @default.
- W4280652960 cites W2791124391 @default.
- W4280652960 cites W2805872963 @default.
- W4280652960 cites W2885572072 @default.
- W4280652960 cites W2912257407 @default.
- W4280652960 cites W2942300156 @default.
- W4280652960 cites W2963142961 @default.
- W4280652960 cites W2963220582 @default.
- W4280652960 cites W4206682372 @default.
- W4280652960 cites W4292070118 @default.
- W4280652960 cites W4297936050 @default.
- W4280652960 cites W4299732909 @default.
- W4280652960 cites W55887128 @default.
- W4280652960 doi "https://doi.org/10.1016/j.disc.2022.112985" @default.
- W4280652960 hasPublicationYear "2022" @default.
- W4280652960 type Work @default.
- W4280652960 citedByCount "1" @default.
- W4280652960 countsByYear W42806529602023 @default.
- W4280652960 crossrefType "journal-article" @default.
- W4280652960 hasAuthorship W4280652960A5020364299 @default.
- W4280652960 hasAuthorship W4280652960A5039626432 @default.
- W4280652960 hasAuthorship W4280652960A5041792622 @default.
- W4280652960 hasAuthorship W4280652960A5091558578 @default.
- W4280652960 hasBestOaLocation W42806529601 @default.
- W4280652960 hasConcept C102192266 @default.
- W4280652960 hasConcept C114614502 @default.
- W4280652960 hasConcept C118615104 @default.
- W4280652960 hasConcept C132525143 @default.
- W4280652960 hasConcept C132569581 @default.
- W4280652960 hasConcept C160446614 @default.
- W4280652960 hasConcept C18359143 @default.
- W4280652960 hasConcept C197657726 @default.
- W4280652960 hasConcept C203776342 @default.
- W4280652960 hasConcept C33923547 @default.
- W4280652960 hasConcept C43517604 @default.
- W4280652960 hasConcept C59824394 @default.
- W4280652960 hasConcept C67810366 @default.
- W4280652960 hasConcept C74133993 @default.
- W4280652960 hasConcept C80899671 @default.
- W4280652960 hasConcept C8554925 @default.
- W4280652960 hasConceptScore W4280652960C102192266 @default.
- W4280652960 hasConceptScore W4280652960C114614502 @default.
- W4280652960 hasConceptScore W4280652960C118615104 @default.
- W4280652960 hasConceptScore W4280652960C132525143 @default.
- W4280652960 hasConceptScore W4280652960C132569581 @default.
- W4280652960 hasConceptScore W4280652960C160446614 @default.
- W4280652960 hasConceptScore W4280652960C18359143 @default.
- W4280652960 hasConceptScore W4280652960C197657726 @default.
- W4280652960 hasConceptScore W4280652960C203776342 @default.
- W4280652960 hasConceptScore W4280652960C33923547 @default.
- W4280652960 hasConceptScore W4280652960C43517604 @default.
- W4280652960 hasConceptScore W4280652960C59824394 @default.
- W4280652960 hasConceptScore W4280652960C67810366 @default.
- W4280652960 hasConceptScore W4280652960C74133993 @default.
- W4280652960 hasConceptScore W4280652960C80899671 @default.
- W4280652960 hasConceptScore W4280652960C8554925 @default.
- W4280652960 hasFunder F4320321408 @default.
- W4280652960 hasFunder F4320322120 @default.
- W4280652960 hasFunder F4320323299 @default.
- W4280652960 hasFunder F4320326441 @default.
- W4280652960 hasIssue "10" @default.