Testing bipartiteness of geometric intersection graphs (Q4962781): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56209807 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2052184512 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: cs/0307023 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:02, 19 April 2024
scientific article; zbMATH DE number 6972949
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Testing bipartiteness of geometric intersection graphs |
scientific article; zbMATH DE number 6972949 |
Statements
Testing bipartiteness of geometric intersection graphs (English)
0 references
5 November 2018
0 references
bipartite graph
0 references
Hopcroft's problem
0 references
coin graph
0 references
disks
0 references
geometric thickness
0 references
graph coloring
0 references
intersection graph
0 references
line segments
0 references
minimum spanning tree
0 references
