The following pages link to (Q3924236):
Displaying 17 items.
- On the isomorphism problem for Helly circular-arc graphs (Q259081) (← links)
- Computing the boxicity of a graph by covering its complement by cointerval graphs (Q585228) (← links)
- Boxicity of circular arc graphs (Q659754) (← links)
- Applications of edge coverings by cliques (Q762498) (← links)
- The relationship between the threshold dimension of split graphs and various dimensional parameters (Q803177) (← links)
- Graph models for scheduling systems with machine saturation property (Q883067) (← 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)
- Boxicity of graphs with bounded degree (Q1024326) (← links)
- A characterization of competition graphs of arbitrary digraphs (Q1055445) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- \(T\)-colorings of graphs: recent results and open problems (Q1182897) (← links)
- Optimal multiple interval assignments in frequency assignment and traffic phasing (Q1208449) (← links)
- Boxicity of graphs on surfaces (Q2376090) (← links)
- The competition number of a graph having exactly one hole (Q2576849) (← links)
- Bounds for the boxicity of Mycielski graphs (Q4634991) (← links)
- On the chromatic number of graphs (Q5942344) (← links)
