Skip to main content

10 Result(s)

within Manu Basavaraju Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Ramsey Numbers for Line Graphs

    Given a graph, the classical Ramsey number R(k, l) is the least number of vertices that need to be in the graph for the existence of a clique of size k or an independent set of size l. Finding R(k, l) exactly ha...

    Huzaifa Abbasi, Manu Basavaraju… in Algorithms and Discrete Applied Mathematics (2020)

  2. No Access

    Chapter and Conference Paper

    The Linear Arboricity Conjecture for 3-Degenerate Graphs

    A k-linear coloring of a graph G is an edge coloring of G with k colors so that each color class forms a linear forest—a forest whose each connected component is a path. The linear arboricity

    Manu Basavaraju, Arijit Bishnu… in Graph-Theoretic Concepts in Computer Scien… (2020)

  3. No Access

    Article

    Separation Dimension of Graphs and Hypergraphs

    Separation dimension of a hypergraph H, denoted by \(\pi (H)\) ...

    Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew… in Algorithmica (2016)

  4. No Access

    Article

    Rainbow Connection Number of Graph Power and Graph Products

    Rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path in which no two...

    Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad… in Graphs and Combinatorics (2014)

  5. No Access

    Article

    Rainbow Connection Number and Radius

    The rainbow connection number, rc(G), of a connected graph G is the minimum number of colours needed to colour its edges, so that every pair of its vertices is connected by at least one path in which no two edges...

    Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad… in Graphs and Combinatorics (2014)

  6. No Access

    Chapter and Conference Paper

    Parameterized Algorithms to Preserve Connectivity

    We study the following family of connectivity problems. For a given λ-edge connected (multi) graph G = (V,E), a set of links L such that G + L = (V, E ∪ L) is (λ + 1)-edge connected, and a positive integer k, the...

    Manu Basavaraju, Fedor V. Fomin, Petr Golovach… in Automata, Languages, and Programming (2014)

  7. No Access

    Chapter and Conference Paper

    Maximal Induced Matchings in Triangle-Free Graphs

    An induced matching in a graph is a set of edges whose endpoints induce a \(1\) -regular subgraph. It is known that every

    Manu Basavaraju, Pinar Heggernes… in Graph-Theoretic Concepts in Computer Scien… (2014)

  8. No Access

    Chapter and Conference Paper

    On the Kernelization Complexity of String Problems

    In Closest String problem we are given an alphabet Σ, a set of strings S = {s 1,s 2, …,s k } over Σ such that |s

    Manu Basavaraju, Fahad Panolan, Ashutosh Rai… in Computing and Combinatorics (2014)

  9. No Access

    Chapter and Conference Paper

    Boxicity and Separation Dimension

    A family \(\mathcal {F}\) of permutations of the vertices of a hypergraph $...

    Manu Basavaraju, L. Sunil Chandran… in Graph-Theoretic Concepts in Computer Scien… (2014)

  10. No Access

    Chapter and Conference Paper

    2-connecting Outerplanar Graphs without Blowing Up the Pathwidth

    Given a connected outerplanar graph G with pathwidth p, we give an algorithm to add edges to G to get a supergraph of G, which is 2-vertex-connected, outerplanar and of pathwidth O(p). As a consequence, we get a ...

    Jasine Babu, Manu Basavaraju, Sunil Chandran Leela… in Computing and Combinatorics (2013)