A unified approach to recognize squares of split graphs
From MaRDI portal
Publication:313959
DOI10.1016/J.TCS.2016.07.037zbMATH Open1349.05328OpenAlexW2181963588MaRDI QIDQ313959FDOQ313959
Authors: Van Bang Le, Andrea Oversberg, Oliver Schaudt 
Publication date: 12 September 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.07.037
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Graph Classes: A Survey
- Computing roots of graphs is hard
- Efficient graph representations
- A good characterization of squares of strongly chordal split graphs
- Computing square roots of trivially perfect and threshold graphs
- A New Algorithm for Generating All the Maximal Independent Sets
- Title not available (Why is that?)
- Recognizing Powers of Proper Interval, Split, and Chordal Graphs
- Title not available (Why is that?)
- Probe threshold and probe trivially perfect graphs
- Decomposition of balanced matrices
- Complexity aspects of the Helly property: graphs and hypergraphs
- On balanced graphs
- Split Graphs Having Dilworth Number Two
- Arboricity, \(h\)-index, and dynamic algorithms
- Hardness Results and Efficient Algorithms for Graph Powers
Cited In (14)
- A characterization of line graphs that are squares of graphs
- A story of diameter, radius, and (almost) Helly property
- Finding cactus roots in polynomial time
- Searching for square-complementary graphs: complexity of recognition and further nonexistence results
- Recognizing Perfect 2-Split Graphs
- A good characterization of squares of strongly chordal split graphs
- Characterizing and recognizing exact-distance squares of graphs
- Computing square roots of trivially perfect and threshold graphs
- Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
- Graph square roots of small distance from degree one graphs
- A linear kernel for finding square roots of almost planar graphs
- Computing square roots of graphs with low maximum degree
- Vertex splitting and the recognition of trapezoid graphs
- Recognizing Powers of Proper Interval, Split, and Chordal Graphs
This page was built for publication: A unified approach to recognize squares of split graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q313959)
