The following pages link to On rigid circuit graphs (Q773621):
Displaying 50 items.
- Some results on the target set selection problem (Q1956258) (← links)
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← links)
- A better upper bound on the chromatic number of (cap, even-hole)-free graphs (Q1981707) (← links)
- Efficiently enumerating minimal triangulations (Q1983135) (← links)
- Upper bounds for the regularity of powers of edge ideals of graphs (Q1998945) (← links)
- Completing colored graphs to meet a target property (Q2030434) (← links)
- Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes (Q2032702) (← links)
- A note on simplicial cliques (Q2037547) (← links)
- Bass-Serre theory for Lie algebras: a homological approach (Q2042928) (← links)
- Ambush cops and robbers (Q2053707) (← links)
- On the maximum cardinality cut problem in proper interval graphs and related graph classes (Q2055967) (← links)
- An improved exact algorithm for minimum dominating set in chordal graphs (Q2059888) (← links)
- On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets (Q2064297) (← links)
- Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
- DP color functions versus chromatic polynomials (Q2070081) (← links)
- Betti numbers of fat forests and their Alexander dual (Q2084692) (← links)
- Convex geometries over induced paths with bounded length (Q2092354) (← links)
- On graphs with equal total domination and Grundy total domination numbers (Q2118158) (← links)
- Distance \(r\)-domination number and \(r\)-independence complexes of graphs (Q2122691) (← links)
- A necessary condition for the equality of the clique number and the convexity number of a graph (Q2127622) (← links)
- Graphs with a unique maximum independent set up to automorphisms (Q2142697) (← links)
- Graph searches and their end vertices (Q2165035) (← links)
- The DP color function of joins and vertex-gluings of graphs (Q2166313) (← links)
- The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality (Q2172410) (← links)
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs (Q2173431) (← links)
- The (theta, wheel)-free graphs. II: Structure theorem (Q2173432) (← links)
- Perfect elimination orderings for symmetric matrices (Q2174877) (← links)
- On strictly chordality-\(k\) graphs (Q2181248) (← links)
- A hierarchy of dismantlings in graphs (Q2185916) (← links)
- Clique coverings and claw-free graphs (Q2189831) (← links)
- Average Betti numbers of induced subcomplexes in triangulations of manifolds (Q2194092) (← links)
- Bounds on regularity of quadratic monomial ideals (Q2194763) (← links)
- Avoidable paths in graphs (Q2215468) (← links)
- Modular construction of free hyperplane arrangements (Q2217955) (← links)
- \(b\)-vectors of chordal graphs (Q2219242) (← links)
- Homological shift ideals (Q2228330) (← links)
- Non-ridge-chordal complexes whose clique complex has shellable Alexander dual (Q2229197) (← links)
- Detecting fixed patterns in chordal graphs in polynomial time (Q2249737) (← links)
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs (Q2253902) (← links)
- Toll convexity (Q2255809) (← links)
- Minimum fill-in of sparse graphs: kernelization and approximation (Q2258069) (← links)
- A conjecture on triangles of graphs (Q2276982) (← links)
- On the triangle clique cover and \(K_t\) clique cover problems (Q2279271) (← links)
- Chordality, \(d\)-collapsibility, and componentwise linear ideals (Q2299646) (← links)
- The intersection of two vertex coloring problems (Q2303434) (← links)
- Colouring exact distance graphs of chordal graphs (Q2305897) (← links)
- Structural submodularity and tangles in abstract separation systems (Q2318482) (← links)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
- Bayesian networks: the minimal triangulations of a graph (Q2330088) (← links)
