The following pages link to Martin Charles Golumbic (Q251894):
Displaying 50 items.
- (Q209590) (redirect page) (← links)
- Separation dimension of graphs and hypergraphs (Q300474) (← links)
- The chain graph sandwich problem (Q646705) (← links)
- A characterization of chain probe graphs (Q646709) (← links)
- Path-bicolorable graphs (Q659746) (← links)
- Counting endpoint sequences for interval orders and interval graphs (Q685648) (← links)
- Irredundancy in circular arc graphs (Q686248) (← links)
- The induced separation dimension of a graph (Q722529) (← links)
- Characterizations of cographs as intersection graphs of paths on a grid (Q741533) (← links)
- The edge intersection graphs of paths in a tree (Q792348) (← links)
- Tolerance graphs (Q798675) (← links)
- An improvement on the complexity of factoring read-once Boolean functions (Q944714) (← links)
- On the bi-enhancement of chordal-bipartite probe graphs (Q991750) (← links)
- Equivalences and the complete hierarchy of intersection graphs of paths in a tree (Q1003465) (← links)
- Intersection models of weakly chordal graphs (Q1026105) (← links)
- Edge and vertex intersection of paths in a tree (Q1060226) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- Trapezoid graphs and their coloring (Q1111577) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- Generalized Fibonacci maximum path graphs (Q1136779) (← links)
- Comparability graphs and intersection graphs (Q1172652) (← links)
- The inducibility of graphs (Q1227631) (← links)
- Comparability graphs and a new matroid (Q1235707) (← links)
- The complexity of comparability graph recognition and coloring (Q1241524) (← links)
- A note on perfect Gaussian elimination (Q1246439) (← links)
- Trivially perfect graphs (Q1248531) (← links)
- Complexity and algorithms for graph and hypergraph sandwich problems (Q1268114) (← links)
- Matrix sandwich problems (Q1307537) (← links)
- On the complexity of DNA physical mapping (Q1338883) (← links)
- Interactive scheduling as a constraint satisfiability problem (Q1356209) (← links)
- Edge-intersection graphs of boundary-generated paths in a grid (Q1693146) (← links)
- Total coloring of rooted path graphs (Q1708273) (← links)
- Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture (Q1837210) (← links)
- On the number of vertices belonging to all maximum stable sets of a graph (Q1850112) (← links)
- Block duplicate graphs and a hierarchy of chordal graphs (Q1850116) (← links)
- Algorithmic graph theory and perfect graphs (Q1886097) (← links)
- Chordal probe graphs (Q1887057) (← links)
- New results on induced matchings (Q1975379) (← links)
- Hardness and approximation for L-EPG and \(B_1\)-EPG graphs (Q2184686) (← links)
- Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2 (Q2374177) (← links)
- On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs (Q2376078) (← links)
- Factoring Boolean functions using graph partitioning (Q2387436) (← links)
- Co-TT graphs and a characterization of split co-TT graphs (Q2448900) (← links)
- The \(k\)-edge intersection graphs of paths in a tree (Q2473042) (← links)
- Representing edge intersection graphs of paths on degree 4 trees (Q2476278) (← links)
- On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems (Q2484367) (← links)
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees (Q2492223) (← links)
- Containment graphs and posets of paths in a tree: wheels and partial wheels (Q2663167) (← links)
- Single bend paths on a grid have strong helly number 4: <i>errata atque emendationes ad</i> “edge intersection graphs of single bend paths on a grid” (Q2811306) (← links)
- String graphs of k-bend paths on a grid (Q2840697) (← links)
