Pages that link to "Item:Q4047571"
From MaRDI portal
The following pages link to An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph (Q4047571):
Displaying 50 items.
- Characterization of common-edge sigraph (Q385160) (← links)
- Fast recognition of doubled graphs (Q385965) (← links)
- List monopolar partitions of claw-free graphs (Q442362) (← links)
- On the hardness of recognizing triangular line graphs (Q442382) (← links)
- On graphs with no induced subdivision of \(K_4\) (Q444381) (← links)
- Forests and trees among Gallai graphs (Q472964) (← links)
- Coloring perfect graphs with no balanced skew-partitions (Q490982) (← links)
- A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of threshold graphs (Q505460) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- An algorithm to recognize a middle graph (Q786829) (← links)
- Generalized line graphs: Cartesian products and complexity of recognition (Q888591) (← links)
- ILIGRA: an efficient inverse line graph algorithm (Q894425) (← links)
- A lower bound on the Hamiltonian path completion number of a line graph (Q902504) (← links)
- Almost every graph is divergent under the biclique operator (Q908300) (← links)
- On stable cutsets in claw-free graphs and planar graphs (Q935842) (← links)
- Partial characterizations of coordinated graphs: Line graphs and complements of forests (Q1014303) (← links)
- Decomposition by clique separators (Q1062072) (← links)
- Intersection graphs of paths in a tree (Q1077439) (← links)
- A polynomial characterization of some graph partitioning problems (Q1108810) (← links)
- A labeling algorithm to recognize a line digraph and output its root graph (Q1163377) (← links)
- The edge Hamiltonian path problem is NP-complete for bipartite graphs (Q1210313) (← links)
- Generalizations of line graphs and applications (Q1237762) (← links)
- On stable cutsets in line graphs (Q1400002) (← links)
- A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. (Q1427178) (← links)
- Degree distribution and assortativity in line graphs of complex networks (Q1619123) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- Basic perfect graphs and their extensions (Q1779506) (← links)
- Reconstructing a graph from its arc incidence graph (Q1926018) (← links)
- Recognizing \(k\)-path graphs (Q1962042) (← links)
- Fixed cardinality stable sets (Q1983123) (← links)
- Recognising graphic and matroidal connectivity functions (Q2005684) (← links)
- Exact algorithms for maximum independent set (Q2013558) (← links)
- Finding the root graph through minimum edge deletion (Q2028798) (← links)
- A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs (Q2034399) (← links)
- Two Hamiltonian cycles (Q2113347) (← links)
- On the iterated edge-biclique operator (Q2132393) (← links)
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs (Q2173431) (← links)
- Color-line and proper color-line graphs (Q2174556) (← links)
- Biclique graphs of interval bigraphs (Q2184675) (← links)
- Clique coverings and claw-free graphs (Q2189831) (← links)
- The (theta, wheel)-free graphs. IV: Induced paths and cycles (Q2221936) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- Detecting strong cliques (Q2312812) (← links)
- Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← links)
- \(r\)-Dynamic chromatic number of some line graphs (Q2322985) (← links)
- Triangle packings and transversals of some \(K_{4}\)-free graphs (Q2413632) (← links)
- A reduction algorithm for the weighted stable set problem in claw-free graphs (Q2448908) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- An upper bound for the chromatic number of line graphs (Q2461774) (← links)
- Decomposing Berge graphs and detecting balanced skew partitions (Q2464161) (← links)
