Pages that link to "Item:Q1765527"
From MaRDI portal
The following pages link to Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs (Q1765527):
Displayed 24 items.
- Graph isomorphism parameterized by elimination distance to bounded degree (Q309797) (← links)
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs (Q344864) (← links)
- Random generation and enumeration of bipartite permutation graphs (Q414425) (← links)
- Characterizing and computing the structure of clique intersections in strongly chordal graphs (Q479046) (← links)
- On orthogonal ray graphs (Q602682) (← links)
- Reformulations in mathematical programming: automatic symmetry detection and exploitation (Q662305) (← links)
- Rooted directed path graphs are leaf powers (Q965972) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- Searching for square-complementary graphs: complexity of recognition and further nonexistence results (Q2022157) (← links)
- Interpretable multi-scale graph descriptors via structural compression (Q2023183) (← links)
- The Weisfeiler-Leman dimension of chordal bipartite graphs without bipartite claw (Q2045400) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs (Q2232254) (← links)
- Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs (Q2457021) (← links)
- Structural properties of word representable graphs (Q2630778) (← links)
- Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs (Q2684481) (← links)
- Symmetry in Mathematical Programming (Q2897300) (← links)
- Random Generation and Enumeration of Proper Interval Graphs (Q3605496) (← links)
- CFI Construction and Balanced Graphs (Q5321700) (← links)
- Simple Geometrical Intersection Graphs (Q5452149) (← links)
- Graph isomorphism restricted by lists (Q5918143) (← links)
- Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs (Q5919325) (← links)
- Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs (Q6184324) (← links)