ScholarLens Back to search
2018•Theoretical Computer ScienceOpen access

A fast deterministic detection of small pattern graphs in graphs without large cliques

Mirosław Kowaluk, Andrzej Lingas

Open full text 1 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Combinatorics, Metric dimension, Clique-sum, Chordal graph, Mathematics, Indifference graph, Maximal independent set, Trapezoid graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A fast deterministic detection of small pattern graphs in graphs without large cliques — Research Paper | ScholarLens