On graphs without a \(C_{4}\) or a diamond (Q531598): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5880194 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(C_{4}\)-free graphs | |||
Property / zbMATH Keywords: \(C_{4}\)-free graphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
diamond-free graphs | |||
Property / zbMATH Keywords: diamond-free graphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
recognition algorithm | |||
Property / zbMATH Keywords: recognition algorithm / rank | |||
Normal rank | |||
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.dam.2010.04.015 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2144047548 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph Classes: A Survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matrix multiplication via arithmetic progressions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Linear Recognition Algorithm for Cographs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On diameters and radii of bridged graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithmic graph theory and perfect graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3943560 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing independent sets in graphs with large girth / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient graph representations / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 23:15, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On graphs without a \(C_{4}\) or a diamond |
scientific article |
Statements
On graphs without a \(C_{4}\) or a diamond (English)
0 references
19 April 2011
0 references
\(C_{4}\)-free graphs
0 references
diamond-free graphs
0 references
recognition algorithm
0 references