diamond-free graph
graph with no diamond as induced subgraph
Press Enter · cited answer in seconds
0 sources
diamond-free graph
Summary
diamond-free graph is a class of the graphs without certain subgraphs[1].
Key Facts
- diamond-free graph's instance of is recorded as class of the graphs without certain subgraphs[2].
- diamond graph is named after diamond-free graph[3].
- diamond-free graph's subclass of is recorded as clique graph[4].
- diamond-free graph's subclass of is recorded as co-fork-free graph[5].
- diamond-free graph's opposite of is recorded as co-diamond-free graph[6].
- diamond-free graph's does not have part is recorded as diamond graph[7].
- diamond-free graph's maintained by WikiProject is recorded as WikiProject Mathematics[8].
- diamond-free graph's graphclasses.org ID is recorded as gc_441[9].
- diamond-free graph's graphclasses.org ID is recorded as gc_1045[10].