The following pages link to Rogers Mathew (Q300472):
Displaying 43 items.
- Separation dimension of graphs and hypergraphs (Q300474) (← links)
- A Dirac-type characterization of \(k\)-chordal graphs (Q394280) (← links)
- Product dimension of forests and bounded treewidth graphs (Q396879) (← links)
- Boxicity of line graphs (Q409342) (← links)
- Rainbow connection number and connectivity (Q426778) (← links)
- Boxicity of leaf powers (Q659669) (← links)
- Chordal bipartite graphs with high boxicity (Q659714) (← links)
- The induced separation dimension of a graph (Q722529) (← links)
- Partial list colouring of certain graphs (Q888600) (← links)
- Upper bound on cubicity in terms of boxicity for graphs of low chromatic number (Q898085) (← links)
- Non-contractible non-edges in 2-connected graphs (Q1675819) (← links)
- Induced-bisecting families of bicolorings for hypergraphs (Q1744760) (← links)
- Fractional \(L\)-intersecting families (Q2001971) (← links)
- Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes (Q2040016) (← links)
- Target set selection parameterized by vertex cover and more (Q2082561) (← links)
- Modular and fractional \(L\)-intersecting families of vector spaces (Q2121787) (← links)
- Conflict-free coloring bounds on open neighborhoods (Q2161000) (← links)
- Bisecting and \(D\)-secting families for set systems (Q2181239) (← links)
- System of unbiased representatives for a collection of bicolorings (Q2201776) (← links)
- Boxicity and cubicity of product graphs (Q2346582) (← links)
- Cubicity, degeneracy, and crossing number (Q2509731) (← links)
- A combinatorial proof of Fisher's inequality (Q2657061) (← links)
- Fractional cross intersecting families (Q2657100) (← links)
- Dimension of CPT posets (Q2663165) (← links)
- Grid obstacle representation of graphs (Q2663991) (← links)
- Local boxicity and maximum degree (Q2675846) (← links)
- Cubicity, Degeneracy, and Crossing Number (Q2911622) (← links)
- Boxicity and Separation Dimension (Q2945181) (← links)
- Maximum Weighted Independent Sets with a Budget (Q2971655) (← links)
- Induced Separation Dimension (Q3181052) (← links)
- Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance (Q3189043) (← links)
- Separation Dimension of Bounded Degree Graphs (Q3453564) (← links)
- Faster Algorithms for Incremental Topological Ordering (Q3521937) (← links)
- Separation dimension and sparsity (Q4553724) (← links)
- (Q5419971) (← links)
- Bipartite powers of k-chordal graphs (Q5747385) (← links)
- A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs (Q6080863) (← links)
- New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring (Q6197752) (← links)
- Flexible list colorings: Maximizing the number of requests satisfied (Q6507084) (← links)
- Extremal Results on Conflict-free Coloring (Q6509938) (← links)
- Flexible list colorings: maximizing the number of requests satisfied (Q6565815) (← links)
- Pliable index coding via conflict-free colorings of hypergraphs (Q6576579) (← links)
- Conflict-free coloring on claw-free graphs and interval graphs (Q6584013) (← links)
