Pages that link to "Item:Q4231782"
From MaRDI portal
The following pages link to Topics in Intersection Graph Theory (Q4231782):
Displayed 50 items.
- Intersection graphs of orthodox paths in trees (Q2413157) (← links)
- Set labelling vertices to ensure adjacency coincides with disjointness (Q2413366) (← links)
- Proper circular arc graphs as intersection graphs of paths on a grid (Q2416437) (← links)
- On the hyperbolicity constant of circular-arc graphs (Q2420429) (← links)
- Some new results on Jacobson graphs (Q2422578) (← links)
- The minimum-area spanning tree problem (Q2432736) (← links)
- Characterization of classical graph classes by weighted clique graphs (Q2448923) (← links)
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149) (← links)
- The complete optimal stars-clustering-tree problem (Q2473041) (← links)
- Geodeticity of the contour of chordal graphs (Q2482108) (← links)
- A new family of proximity graphs: class cover catch digraphs (Q2506361) (← links)
- Maxclique and unit disk characterizations of strongly chordal graphs (Q2509548) (← links)
- Requiring chords in cycles (Q2566156) (← links)
- The numbers of shared upper bounds determine a poset (Q2572468) (← links)
- Computing the clique-separator graph for an interval graph in linear time (Q2628270) (← links)
- Dot product dimensions of graphs (Q2636805) (← links)
- Chordal multipartite graphs and chordal colorings (Q2643326) (← links)
- Complete characterization of incorrect orthology assignments in best match graphs (Q2659043) (← links)
- Vertices removal for feasibility of clustered spanning trees (Q2663996) (← links)
- Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs (Q2684481) (← links)
- Temporal matching on geometric graph data (Q2692739) (← links)
- On the complexity of recognizing Stick, BipHook and max point-tolerance graphs (Q2693628) (← links)
- Strengthening strongly chordal graphs (Q2798313) (← links)
- WHEN ALL MINIMAL VERTEX SEPARATORS INDUCE COMPLETE OR EDGELESS SUBGRAPHS (Q2864857) (← links)
- Symmetric graph-theoretic roles of two-pairs and chords of cycles (Q2920879) (← links)
- Contact Representations of Planar Graphs: Extending a Partial Representation is Hard (Q2945185) (← links)
- The Longest Path Problem is Polynomial on Cocomparability Graphs (Q3057610) (← links)
- From Path Graphs to Directed Path Graphs (Q3057630) (← links)
- Split Clique Graph Complexity (Q3104760) (← links)
- Finding a Maximum-Weight Convex Set in a Chordal Graph (Q3121516) (← links)
- Star coloring of graphs (Q3159375) (← links)
- Characterizing directed path graphs by forbidden asteroids (Q3174239) (← links)
- When every k-cycle has at least f(k) chords (Q3174243) (← links)
- Packing of (0, 1)-matrices (Q3423133) (← links)
- TREE DIAGRAMS FOR STRING LINKS (Q3426796) (← links)
- Distance Labeling for Permutation Graphs (Q3439382) (← links)
- Clique trees of chordal graphs: leafage and 3-asteroidals (Q3503559) (← links)
- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete (Q3508571) (← links)
- MAXIMUM AREA INDEPENDENT SETS IN DISK INTERSECTION GRAPHS (Q3562849) (← links)
- SUBEXPONENTIAL INTERVAL GRAPHS GENERATED BY IMMIGRATION–DEATH PROCESSES (Q3564642) (← links)
- A kind of intersection graph of vector space (Q3574293) (← links)
- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs (Q3605497) (← links)
- Characterizing path graphs by forbidden induced subgraphs (Q3652563) (← links)
- Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs (Q4568089) (← links)
- Intersection Graphs of Rays and Grounded Segments (Q4585058) (← links)
- Kneser Ranks of Random Graphs and Minimum Difference Representations (Q4641757) (← links)
- Note on p-competition graphs of spiders (Q4644796) (← links)
- Archimedean ϕ ‐tolerance graphs (Q4798113) (← links)
- On the Iterated Biclique Operator (Q4920658) (← links)
- THE INTERSECTION GRAPH OF GAMMA SETS IN THE TOTAL GRAPH OF A COMMUTATIVE RING-I (Q4923935) (← links)