The following pages link to (Q2768334):
Displaying 11 items.
- Shifting strategy for geometric graphs without geometry (Q454249) (← links)
- On distance constrained labeling of disk graphs (Q703553) (← links)
- Co-bipartite neighborhood edge elimination orderings (Q1689989) (← links)
- A simple linear time algorithm for cograph recognition (Q1764804) (← links)
- On-line coloring of geometric intersection graphs (Q1862127) (← links)
- Independent sets in Line of Sight networks (Q2201775) (← links)
- \( L ( 2 , 1 )\)-labeling of disk intersection graphs (Q2306585) (← links)
- Full characterization of a class of graphs tailored for software watermarking (Q2415367) (← links)
- Bisectored unit disk graphs (Q4474290) (← links)
- Random channel assignment in the plane (Q4800395) (← links)
- Computing a maximum clique in geometric superclasses of disk graphs (Q5918528) (← links)
