2013 - Member of Academia Europaea
Martin Charles Golumbic spends much of his time researching Combinatorics, Discrete mathematics, Indifference graph, Interval graph and Chordal graph. His study in Split graph, Trivially perfect graph, Perfect graph theorem, Perfect graph and Independent set falls under the purview of Combinatorics. Martin Charles Golumbic combines subjects such as Graph theory and Interval with his study of Discrete mathematics.
The various areas that Martin Charles Golumbic examines in his Interval graph study include Graph coloring, Permutation graph and Forbidden graph characterization. As a part of the same scientific study, Martin Charles Golumbic usually deals with the Permutation graph, concentrating on Trapezoid graph and frequently concerns with Complete coloring. Martin Charles Golumbic interconnects Induced subgraph isomorphism problem, Theoretical computer science, Threshold graph, Topological graph theory and Circle graph in the investigation of issues within Forbidden graph characterization.
His primary areas of investigation include Combinatorics, Discrete mathematics, Chordal graph, Indifference graph and Interval graph. His work on Combinatorics deals in particular with Split graph, Pathwidth, Cograph, Graph and Line graph. His studies link Threshold graph with Split graph.
His Chordal graph research integrates issues from Graph coloring and Bipartite graph. His studies deal with areas such as Clique-sum, Strong perfect graph theorem and Maximal independent set as well as Indifference graph. His work carried out in the field of Interval graph brings together such families of science as Intersection graph and Interval order, Interval.
Martin Charles Golumbic mainly investigates Combinatorics, Discrete mathematics, Chordal graph, Indifference graph and Graph. His study looks at the relationship between Combinatorics and fields such as Upper and lower bounds, as well as how they intersect with chemical problems. His study in Indifference graph is interdisciplinary in nature, drawing from both Clique-sum, Pathwidth, Maximal independent set, Trapezoid graph and Metric dimension.
His Graph research includes themes of Partially ordered set, Greedy algorithm and Conjecture. In his study, Forbidden graph characterization is strongly linked to Pancyclic graph, which falls under the umbrella field of Cograph. Split graph and Interval graph are commonly linked in his work.
Martin Charles Golumbic mostly deals with Combinatorics, Discrete mathematics, Chordal graph, Cograph and Indifference graph. His Line graph, Trapezoid graph, Pathwidth, Clique-sum and Dimension study are his primary interests in Combinatorics. As a part of the same scientific family, Martin Charles Golumbic mostly works in the field of Trapezoid graph, focusing on Maximal independent set and, on occasion, Longest path problem.
His study in Split graph, Graph, Graph sandwich problem and Voltage graph are all subfields of Discrete mathematics. His studies in Split graph integrate themes in fields like Lexicographic breadth-first search, Forbidden graph characterization, Distance-hereditary graph, Treewidth and Interval graph. Martin Charles Golumbic has researched Cograph in several fields, including Induced subgraph, Pancyclic graph, Comparability graph, Universal graph and Induced path.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Algorithmic graph theory and perfect graphs
Martin Charles Golumbic.
Complexity and algorithms for reasoning about time: a graph-theoretic approach
Martin Charles Golumbic;Ron Shamir.
Journal of the ACM (1993)
ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
Martin Charles Golumbic;Udi Rotics.
International Journal of Foundations of Computer Science (2000)
Graph sandwich problems
Martin Charles Golumbic;Haim Kaplan;Ron Shamir.
Journal of Algorithms (1995)
Four strikes against physical mapping of DNA.
Paul W. Goldberg;Martin Charles Golumbic;Haim Kaplan;Ron Shamir.
Journal of Computational Biology (1995)
CHAPTER 3 – Perfect Graphs
Martin Charles Golumbic.
Algorithmic Graph Theory and Perfect Graphs (1980)
Trapezoid graphs and their coloring
Ido Dagan;Martin Charles Golumbic;Ron Yair Pinter.
Discrete Applied Mathematics (1988)
Perfect Elimination and Chordal Bipartite Graphs
Martin Charles Golumbic;Clinton F. Goss.
Journal of Graph Theory (1978)
Spill code minimization techniques for optimizing compliers
D. Bernstein;M. Golumbic;y. Mansour;R. Pinter.
programming language design and implementation (1989)
The edge intersection graphs of paths in a tree
Martin Charles Golumbic;Robert E Jamison.
Journal of Combinatorial Theory, Series B (1985)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: