The following pages link to On rigid circuit graphs (Q773621):
Displaying 50 items.
- Revisiting Decomposition by Clique Separators (Q4610181) (← links)
- <i>t</i>-clique ideal and <i>t</i>-independence ideal of a graph (Q4641487) (← links)
- How to use the minimal separators of a graph for its chordal triangulation (Q4645172) (← links)
- Disjoint clique cutsets in graphs without long holes (Q4676589) (← links)
- Graphs with least number of colorings (Q4842706) (← links)
- On the computational complexity of ordered subgraph recognition (Q4851929) (← links)
- SURFACE SUBGROUPS OF GRAPH PRODUCTS OF GROUPS (Q4904509) (← links)
- (Q4957125) (← links)
- Cycle Extendability of Hamiltonian Strongly Chordal Graphs (Q4959662) (← links)
- (Q4966374) (← links)
- Heroes in Orientations of Chordal Graphs (Q5043055) (← links)
- Edge erasures and chordal graphs (Q5061692) (← links)
- A simple linear time algorithm for triangulating three-colored graphs (Q5096799) (← links)
- Vertex Deletion Problems on Chordal Graphs (Q5136314) (← links)
- (Q5150665) (← links)
- Zero-divisor graphs of Catalan monoid (Q5165035) (← links)
- Two strikes against perfect phylogeny (Q5204323) (← links)
- On the cover ideals of chordal graphs (Q5214023) (← links)
- ℱ-WORM colorings of some 2-trees: partition vectors (Q5225032) (← links)
- Linear separation of connected dominating sets in graphs (Q5225055) (← links)
- Hamiltonian Chordal Graphs are not Cycle Extendable (Q5254087) (← links)
- Linear-Time Generation of Random Chordal Graphs (Q5283388) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
- Incidence matrices with the consecutive 1’s property (Q5331785) (← links)
- Computation in Causal Graphs (Q5377356) (← links)
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs (Q5387822) (← links)
- Bounding the projective dimension of a squarefree monomial ideal via domination in clutters (Q5496298) (← links)
- Algorithms for a maximum clique and a maximum independent set of a circle graph (Q5675749) (← links)
- (Q5743514) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
- Disjointness graphs of segments in the space (Q5886095) (← links)
- Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs (Q5890507) (← links)
- Graph transformations preserving the stability number (Q5916099) (← links)
- Graph theory (Q5917392) (← links)
- Wait-free approximate agreement on graphs (Q5918635) (← links)
- Exact algorithms for a discrete metric labeling problem (Q5920404) (← links)
- Wait-free approximate agreement on graphs (Q5925616) (← links)
- Domination graphs: Examples and counterexamples (Q5936465) (← links)
- Asteroidal triples of moplexes (Q5939228) (← links)
- Finding houses and holes in graphs (Q5941278) (← links)
- Deterministic inverse zero-patterns (Q5951964) (← links)
- \(k\)-power domination in block graphs (Q5963656) (← links)
- Space-efficient algorithms for reachability in directed geometric graphs (Q6039899) (← links)
- Some results on connected vertex separators (Q6040587) (← links)
- Dirac's theorem and multigraded syzygies (Q6042131) (← links)
- Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph (Q6046133) (← links)
- ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2−(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$ (Q6047969) (← links)
- Diameter and connectivity of finite simple graphs (Q6052766) (← links)
- Application of the clique minimal separator decomposition to finding the maximum weight \(\{K_1,K_2,k,l\}\)-packing in a graph (Q6055212) (← links)
- Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations (Q6055397) (← links)
