Pages that link to "Item:Q585228"

The following pages link to Computing the boxicity of a graph by covering its complement by cointerval graphs (Q585228):

Displayed 33 items.

• Matchings, coverings, and Castelnuovo-Mumford regularity (Q405389) ‎ (← links)
• Boxicity of line graphs (Q409342) ‎ (← links)
• Boxicity of leaf powers (Q659669) ‎ (← links)
• Chordal bipartite graphs with high boxicity (Q659714) ‎ (← links)
• Boxicity of circular arc graphs (Q659754) ‎ (← links)
• Grid intersection graphs and boxicity (Q685652) ‎ (← links)
• On the stab number of rectangle intersection graphs (Q778517) ‎ (← links)
• The relationship between the threshold dimension of split graphs and various dimensional parameters (Q803177) ‎ (← links)
• Bounds on the Stanley depth and Stanley regularity of edge ideals of clutters (Q901030) ‎ (← links)
• Dimension-2 poset competition numbers and dimension-2 poset double competition numbers (Q968201) ‎ (← links)
• Boxicity and cubicity of asteroidal triple free graphs (Q968429) ‎ (← links)
• The cubicity of hypercube graphs (Q998463) ‎ (← links)
• Boxicity of graphs with bounded degree (Q1024326) ‎ (← links)
• Cubicity, boxicity, and vertex cover (Q1025509) ‎ (← links)
• An upper bound for cubicity in terms of boxicity (Q1025528) ‎ (← links)
• On the cubicity of certain graphs (Q1041732) ‎ (← links)
• Irrepresentability by multiple intersection, or why the interval number is unbounded (Q1065021) ‎ (← links)
• On dimensional properties of graphs (Q1121914) ‎ (← links)
• Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) ‎ (← links)
• Intersection dimensions of graph classes (Q1334942) ‎ (← links)
• Local and union boxicity (Q1709530) ‎ (← links)
• Towards a comprehensive theory of conflict-tolerance graphs (Q1759850) ‎ (← links)
• Representability and boxicity of simplicial complexes (Q2167318) ‎ (← links)
• Lower bounds for boxicity (Q2341923) ‎ (← links)
• Chronological rectangle digraphs which are two-terminal series-parallel (Q2414469) ‎ (← links)
• Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs (Q2457021) ‎ (← links)
• Boxicity and maximum degree (Q2477634) ‎ (← links)
• Cubicity, degeneracy, and crossing number (Q2509731) ‎ (← links)
• Boxicity and treewidth (Q2642011) ‎ (← links)
• On the boxicity of Kneser graphs and complements of line graphs (Q2689506) ‎ (← links)
• Cubicity of interval graphs and the claw number (Q3061191) ‎ (← links)
• Bounds for the boxicity of Mycielski graphs (Q4634991) ‎ (← links)
• On the Computation of the Competition Number of a Graph (Q4750663) ‎ (← links)