#### Filter Results:

- Full text PDF available (19)

#### Publication Year

1978

2016

- This year (0)
- Last 5 years (12)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- M O Bradley, B Bhuyan, M C Francis, R Langenbach, A Peterson, E Huberman
- Mutation research
- 1981

The report reviews and evaluates the current literature (about 125 primary publications) on chemically induced specific locus mutations in the V79 Chinese hamster lung cell line. The V79 cell is convenient to use for mutagenesis studies since it has a rapid growth rate, high plating efficiency, and a stable karyotype. Mutation can be easily measured at… (More)

- L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
- J. Comb. Theory, Ser. B
- 2008

An axis-parallel d–dimensional box is a Cartesian product R 1 × R 2 × · · · × R d where R i (for 1 ≤ i ≤ d) is a closed interval of the form [a i , b i ] on the real line. For a graph G, its boxicity box(G) is the minimum dimension d, such that G is representable as the intersection graph of (axis–parallel) boxes in d–dimensional space. The concept of… (More)

- Stefan Felsner, Mathew C. Francis
- Symposium on Computational Geometry
- 2011

We prove that every planar graph has a representation using axis-parallel cubes in three dimensions in such a way that there is a cube corresponding to each vertex of the planar graph and two cubes have a non-empty intersection if and only if their corresponding vertices are adjacent. Moreover, when two cubes have a non-empty intersection, they just touch… (More)

- L. Sunil Chandran, Mathew C. Francis, Rogers Mathew
- Graphs and Combinatorics
- 2011

The boxicity of a graph G is defined as the minimum integer k such that G is an intersection graph of axis-parallel k-dimensional boxes. Chordal bipartite graphs are bipartite graphs that do not contain an induced cycle of length greater than 4. It was conjectured by Otachi, Okamoto and Yamazaki that chordal bipartite graphs have boxicity at most 2. We… (More)

- Mathew C. Francis, Jan Kratochvíl, Tomás Vyskocil
- Discrete Mathematics
- 2012

A graph is said to be a segment graph if its vertices can be mapped to line segments in the plane such that two vertices have an edge between them if and only if their corresponding line segments intersect. Kratochvíl and Kuběna [2] asked the question of whether the complements of planar graphs are segment graphs. We show here that the complements of all… (More)

- Manu Basavaraju, Mathew C. Francis
- Journal of Graph Theory
- 2015

A strong edge colouring of a graph is an assignment of colours to the edges of the graph such that for every colour, the set of edges that are given that colour form an induced matching in the graph. The strong chromatic index of a graph G, denoted by χ ′ s (G), is the minimum number of colours needed in any strong edge colouring of G. A graph is said to be… (More)

- L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
- Algorithmica
- 2008

An axis-parallel k-dimensional box is a Cartesian product R 1×R 2×⋅⋅⋅×R k where R i (for 1≤i≤k) is a closed interval of the form [a i ,b i ] on the real line. For a graph G, its boxicity box (G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds… (More)

- Mathew C. Francis, Daniel Gonçalves, Pascal Ochem
- Algorithmica
- 2012

Multiple interval graphs are variants of interval graphs where instead of a single interval, each vertex is assigned a set of intervals on the real line. We study the complexity of the MAXIMUM CLIQUE problem in several classes of multiple interval graphs. The MAXIMUM CLIQUE problem, or the problem of finding the size of the maximum clique, is known to be… (More)

- L. Sunil Chandran, Mathew C. Francis, Santhosh Suresh
- Discrete Mathematics
- 2009

A k-dimensional box is the Cartesian product R1 × R2 × · · · × R k where each Ri is a closed interval on the real line. The boxicity of a graph G, denoted as box(G) is the minimum integer k such that G is the intersection graph of a collection of k-dimensional boxes. Halin graphs are the graphs formed by taking a tree with no degree 2 vertex and then… (More)