Pages that link to "Item:Q2264685"

The following pages link to A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G (Q2264685):

Displaying 50 items.

• Strong cliques and equistability of EPT graphs (Q260014) (← links)
• Circumferences of 3-connected claw-free graphs (Q267172) (← links)
• A twelve vertex theorem for 3-connected claw-free graphs (Q292255) (← links)
• On equistable, split, CIS, and related classes of graphs (Q344829) (← links)
• Fast recognition of doubled graphs (Q385965) (← links)
• A characterization of line graphs that are squares of graphs (Q400504) (← links)
• On weighted efficient total domination (Q414423) (← links)
• Packing cycles exactly in polynomial time (Q421271) (← links)
• On claw-free \(t\)-perfect graphs (Q431021) (← links)
• Complexity of independent set reconfigurability problems (Q441866) (← 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)
• The clique-transversal set problem in claw-free graphs with degree at most 4 (Q477680) (← links)
• Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
• Coloring perfect graphs with no balanced skew-partitions (Q490982) (← links)
• An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
• Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs (Q503616) (← 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)
• Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (Q536646) (← 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)
• On stable cutsets in claw-free graphs and planar graphs (Q935842) (← links)
• Computing sharp 2-factors in claw-free graphs (Q988693) (← links)
• The parameterized complexity of the induced matching problem (Q1028465) (← links)
• Linear algorithms to recognize outerplanar and maximal outerplanar graphs (Q1144938) (← links)
• The edge Hamiltonian path problem is NP-complete for bipartite graphs (Q1210313) (← links)
• Even and odd pairs in linegraphs of bipartite graphs (Q1345522) (← links)
• Recognizing intersection graphs of linear uniform hypergraphs (Q1376077) (← links)
• Polyhedral characterizations and perfection of line graphs (Q1382259) (← links)
• On stable cutsets in line graphs (Q1400002) (← links)
• Clique family inequalities for the stable set polytope of quasi-line graphs. (Q1414593) (← 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)
• Complexity classification of the edge coloring problem for a family of graph classes (Q1675533) (← links)
• Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
• Stable sets in \(\{\mathrm{ISK4,wheel}\}\)-free graphs (Q1709574) (← links)
• Hamiltonicity of claw-free graphs and Fan-type conditions (Q1727781) (← links)
• Basic perfect graphs and their extensions (Q1779506) (← links)
• Reconstructing a graph from its arc incidence graph (Q1926018) (← links)
• Exact algorithms for finding longest cycles in claw-free graphs (Q1939671) (← links)
• Recognizing \(k\)-path graphs (Q1962042) (← links)
• The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness (Q2007724) (← links)
• Finding the root graph through minimum edge deletion (Q2028798) (← links)
• A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs (Q2034399) (← 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)