A note on the recognition of bisplit graphs (Q2501548): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2006.04.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969655505 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bisplit graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: List Partitions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Modular decomposition and transitive orientation / rank | |||
Normal rank | |||
Latest revision as of 20:26, 24 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the recognition of bisplit graphs |
scientific article |
Statements
A note on the recognition of bisplit graphs (English)
0 references
14 September 2006
0 references
3-colorable graphs
0 references
recognition algorithm
0 references
