The following pages link to Mathew C. Francis (Q323042):
Displaying 42 items.
- VPG and EPG bend-numbers of Halin graphs (Q323044) (← links)
- Recognition and characterization of chronological interval digraphs (Q396800) (← links)
- Segment representation of a subclass of co-planar graphs (Q418892) (← links)
- (Q591913) (redirect page) (← links)
- Boxicity of leaf powers (Q659669) (← links)
- Chordal bipartite graphs with high boxicity (Q659714) (← links)
- On the stab number of rectangle intersection graphs (Q778517) (← links)
- Geometric representation of graphs in low dimension using axis parallel boxes (Q848956) (← links)
- Boxicity of Halin graphs (Q1025946) (← links)
- On the cubicity of interval graphs (Q1043802) (← links)
- Non-contractible non-edges in 2-connected graphs (Q1675819) (← links)
- Dushnik-Miller dimension of contact systems of \(d\)-dimensional boxes (Q1689958) (← links)
- Cubicity and bandwidth (Q1938886) (← links)
- Representing graphs as the intersection of cographs and threshold graphs (Q2040010) (← links)
- Extending some results on the second neighborhood conjecture (Q2078833) (← links)
- On subclasses of interval count two and on Fishburn's conjecture (Q2091806) (← links)
- The linear arboricity conjecture for 3-degenerate graphs (Q2110640) (← links)
- On graphs whose eternal vertex cover number and vertex cover number coincide (Q2161248) (← links)
- On graphs with minimal eternal vertex cover number (Q2326577) (← links)
- The maximum clique problem in multiple interval graphs (Q2350898) (← links)
- Boxicity and maximum degree (Q2477634) (← links)
- Strong Chromatic Index of Chordless Graphs (Q2947859) (← links)
- Partially Polynomial Kernels for Set Cover and Test Cover (Q2963898) (← links)
- Uniquely Restricted Matchings in Interval Graphs (Q3130447) (← links)
- Blocking Quadruple: A New Obstruction to Circular-Arc Graphs (Q3192153) (← links)
- On the Cubicity of Interval Graphs (Q3503487) (← links)
- On the Cubicity of AT-Free Graphs and Circular-Arc Graphs (Q3655149) (← links)
- Object Tracking with Classification Score Weighted Histogram of Sparse Codes (Q5045359) (← links)
- The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract) (Q5200494) (← links)
- Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm (Q5363059) (← links)
- Contact representations of planar graphs with cubes (Q5404445) (← links)
- Partially Polynomial Kernels for Set Cover and Test Cover (Q5741085) (← links)
- The lexicographic method for the threshold cover problem (Q5896104) (← links)
- On induced colourful paths in triangle-free graphs (Q5915804) (← links)
- Recognizing \(k\)-clique extendible orderings (Q5918596) (← links)
- On rectangle intersection graphs with stab number at most two (Q5919053) (← links)
- On rectangle intersection graphs with stab number at most two (Q5919634) (← links)
- Recognizing \(k\)-clique extendible orderings (Q5925536) (← links)
- The lexicographic method for the threshold cover problem (Q5925705) (← links)
- A \(p\)-centered coloring for the grid using \(O(p)\) colors (Q6080129) (← links)
- On the kernel and related problems in interval digraphs (Q6103517) (← links)
- (Q6147514) (← links)
