Pages that link to "Item:Q313959"
From MaRDI portal
The following pages link to A unified approach to recognize squares of split graphs (Q313959):
Displaying 14 items.
- A characterization of line graphs that are squares of graphs (Q400504) (← links)
- Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs (Q497674) (← links)
- Finding cactus roots in polynomial time (Q726100) (← links)
- A good characterization of squares of strongly chordal split graphs (Q1944051) (← links)
- Searching for square-complementary graphs: complexity of recognition and further nonexistence results (Q2022157) (← links)
- Vertex splitting and the recognition of trapezoid graphs (Q2275914) (← links)
- A linear kernel for finding square roots of almost planar graphs (Q2402259) (← links)
- Computing square roots of graphs with low maximum degree (Q2413970) (← links)
- Computing square roots of trivially perfect and threshold graphs (Q2446337) (← links)
- Bipartite roots of graphs (Q2944512) (← links)
- Recognizing Perfect 2-Split Graphs (Q4943703) (← links)
- Graph square roots of small distance from degree one graphs (Q5918752) (← links)
- Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 (Q5920195) (← links)
- A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)
