# Critical graph

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- IEEE Journal on Selected Areas in Communications
- 2015

In this paper, we define critical graphs as minimal graphs that support a given set of rates for the index coding problem andâ€¦Â (More)

Is this relevant?

2013

2013

- ANALCO
- 2013

We analyze several extremal parameters like the diameter or the maximum degree in sub-critial graph classes. Sub-critical graphâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- PVLDB
- 2010

The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and miningâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- 2009

This research seeks to understand which of three different strategic orientations of the firm (customer, competitive, andâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- 2007

The capabilities of a firm, or any organization, lie primarily in the organizing principles by which individual and functionalâ€¦Â (More)

Is this relevant?

2006

2006

- Discrete Mathematics
- 2006

A graph G is dot-critical if contracting any edge decreases the domination number. It is totally dot-critical if identifying anyâ€¦Â (More)

Is this relevant?

2004

2004

- Appl. Math. Lett.
- 2004

K e y w o r d s C o n n e c t e d domination number, Connected domination critical graph, Tree, Diameter. 1. I N T R O D U C T Iâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Nature Medicine
- 2004

Signaling through the second messengers calcium and diacylglycerol (DAG) is a critical element in many biological systemsâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Organization Science
- 2002

In this paper, I outline a perspective on knowing in practice which highlights the essential role of human action in knowing howâ€¦Â (More)

Is this relevant?

1995

1995

- Networks
- 1995

A graph G is vertex domination-critical if for any vertex v of G the domination number of G v is less than the domination numberâ€¦Â (More)

Is this relevant?