Pages that link to "Item:Q4231782"
From MaRDI portal
The following pages link to Topics in Intersection Graph Theory (Q4231782):
Displayed 50 items.
- 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)
- SOME RESULTS ON THE INTERSECTION GRAPHS OF IDEALS OF RINGS (Q4923937) (← links)
- Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs (Q4990134) (← links)
- (Q5000291) (← links)
- (Q5014360) (← links)
- (Q5026980) (← links)
- Topological Classification of RNA Structures via Intersection Graph (Q5055988) (← links)
- Automorphism group of the intersection graph of ideals over a matrix ring (Q5070356) (← links)
- (Q5092371) (← links)
- (Q5115779) (← links)
- Bearing-only formation control of multi-agent systems in local reference frames (Q5157936) (← links)
- A NEW CLASS OF WEAKLY PERFECT GRAPHS ATTACHED TO S-ACTS (Q5229600) (← links)
- (Q5238130) (← links)
- Dynamic Distance Hereditary Graphs Using Split Decomposition (Q5387744) (← links)
- Simple Geometrical Intersection Graphs (Q5452149) (← links)
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers (Q5458553) (← links)