Pages that link to "Item:Q1846437"

The following pages link to A characterisation of rigid circuit graphs (Q1846437):

Displaying 50 items.

• Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
• Finding intersection models: from chordal to Helly circular-arc graphs (Q409451) (← links)
• Reduced clique graphs of chordal graphs (Q412263) (← links)
• An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
• Separator orders in interval, cocomparability, and AT-free graphs (Q534331) (← links)
• Graph triangulations and the compatibility of unrooted phylogenetic trees (Q628277) (← links)
• Characterization and representation problems for intersection betweennesses (Q628325) (← links)
• Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
• Peakless functions on graphs (Q678883) (← links)
• Tree reconstruction from multi-state characters (Q696854) (← links)
• Fast compatibility testing for rooted phylogenetic trees (Q724246) (← links)
• Extending cycles in graphs (Q750461) (← links)
• Some aspects of perfect elimination orderings in chordal graphs (Q792351) (← links)
• On the representation of triangulation graphs in trees (Q794674) (← links)
• Minimal triangulations of graphs: a survey (Q819823) (← links)
• A vertex incremental approach for maintaining chordality (Q819824) (← links)
• Tree representations of graphs (Q875046) (← links)
• Intersection representations of matrices by subtrees and unicycles on graphs (Q935839) (← links)
• Counting the number of independent sets in chordal graphs (Q935840) (← links)
• Treewidth computations. I: Upper bounds (Q964001) (← links)
• On the complexity of computing treelength (Q972342) (← links)
• Exact leaf powers (Q982668) (← links)
• A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs (Q989571) (← links)
• On compact and efficient routing in certain graph classes (Q997073) (← links)
• Equivalences and the complete hierarchy of intersection graphs of paths in a tree (Q1003465) (← links)
• Intersection models of weakly chordal graphs (Q1026105) (← links)
• The clique-separator graph for chordal graphs (Q1026133) (← links)
• Brambles and independent packings in chordal graphs (Q1045070) (← links)
• NP-complete problems simplified on tree schemas (Q1056539) (← links)
• Interval graphs and related topics (Q1060229) (← links)
• Intersection graphs of paths in a tree (Q1077439) (← links)
• Characterizing intersection classes of graphs (Q1078582) (← links)
• Graph minors. V. Excluding a planar graph (Q1079583) (← links)
• Neighborhood perfect graphs (Q1081622) (← links)
• Tree-decompositions, tree-representability and chordal graphs (Q1104938) (← links)
• Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs (Q1111390) (← links)
• Simplicial decompositions of graphs: A survey of applications (Q1118617) (← links)
• Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
• Locational analysis (Q1173002) (← links)
• Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
• Intersection properties of graphs (Q1175421) (← links)
• Some aspects of the semi-perfect elimination (Q1175796) (← links)
• Cycle-free partial orders and chordal comparability graphs (Q1182042) (← links)
• Convex tree realizations of partitions (Q1195647) (← links)
• The complexity of reconstructing trees from qualitative characters and subtrees (Q1203103) (← links)
• Information storage and retrieval - mathematical foundations. II: Combinatorial problems (Q1235990) (← links)
• A note on perfect Gaussian elimination (Q1246439) (← links)
• Trivially perfect graphs (Q1248531) (← links)
• Hypergraphes arbores (Q1252357) (← links)
• Counting clique trees and computing perfect elimination schemes in parallel (Q1262131) (← links)