The following pages link to On rigid circuit graphs (Q773621):
Displaying 50 items.
- A note on perfect orders (Q1124614) (← links)
- Inheritance principles for chordal graphs (Q1173947) (← links)
- Covering all cliques of a graph (Q1174130) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Some aspects of the semi-perfect elimination (Q1175796) (← links)
- Some properties of graph centroids (Q1179740) (← links)
- Finding large holes (Q1182105) (← links)
- An inertia formula for Hermitian matrices with sparse inverses (Q1183205) (← links)
- A linear-time algorithm for isomorphism of a subclass of chordal graphs (Q1195864) (← links)
- On slim graphs, even pairs, and star-cutsets (Q1199476) (← links)
- Studies on hypergraphs. I: Hyperforests (Q1209154) (← links)
- An algorithm for testing chordality of graphs (Q1216324) (← links)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms (Q1242450) (← links)
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrix (Q1243572) (← links)
- Algorithms on clique separable graphs (Q1246434) (← links)
- A note on perfect Gaussian elimination (Q1246439) (← links)
- Counting clique trees and computing perfect elimination schemes in parallel (Q1262131) (← links)
- Induced matchings (Q1262877) (← links)
- Phylogeny numbers (Q1270783) (← links)
- Minimal vertex separators of chordal graphs (Q1281392) (← links)
- Sequential colorings and perfect graphs (Q1293205) (← links)
- \(P_4\)-domination in minimal imperfect graphs (Q1293209) (← links)
- The forbidden subgraph characterization of directed vertex graphs (Q1297413) (← links)
- On Tucker vertices of graphs (Q1301659) (← links)
- Pseudo-chordal mixed hypergraphs (Q1301719) (← links)
- The maximum clique problem (Q1318271) (← links)
- Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\) (Q1323406) (← links)
- A parallel algorithm for computing Steiner trees in strongly chordal graphs (Q1329803) (← links)
- Separation of two convex sets in convexity structures (Q1331267) (← links)
- The parallel solution of domination problems on chordal and strongly chordal graphs (Q1331893) (← links)
- The generating polynomial and Euler characteristic of intersection graphs (Q1332411) (← links)
- The struction algorithm for the maximum stable set problem revisited (Q1332429) (← links)
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs (Q1339397) (← links)
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730) (← links)
- Finding minimum height elimination trees for interval graphs in polynomial time (Q1347072) (← links)
- Clique tree generalization and new subclasses of chordal graphs (Q1348383) (← links)
- Metric graphs elastically embeddable in the plane (Q1352120) (← links)
- Coloring perfect degenerate graphs (Q1356545) (← links)
- On graphs in which any pair of colour classes but one induces a tree (Q1357722) (← links)
- Cuts, matrix completions and graph rigidity (Q1365058) (← links)
- Planar graphs with least chromatic coefficients (Q1366785) (← links)
- Characterizations and algorithmic applications of chordal graph embeddings (Q1372739) (← links)
- Universally signable graphs (Q1375057) (← links)
- Chromaticity of chordal graphs (Q1376068) (← links)
- Recognizing interval digraphs and interval bigraphs in polynomial time (Q1377666) (← links)
- Meyniel weakly triangulated graphs. II: A theorem of Dirac (Q1377671) (← links)
- On the structure and chromaticity of graphs in which any two colour classes induce a tree (Q1377681) (← links)
- An algorithm for coloring some perfect graphs (Q1382811) (← links)
- A note on \(r\)-dominating cliques (Q1382816) (← links)
- On treewidth and minimum fill-in of asteroidal triple-free graphs (Q1392207) (← links)
