Intersection dimension and graph invariants
DOI10.7151/dmgt.2173zbMath1453.05074OpenAlexW2898361955WikidataQ129036177 ScholiaQ129036177MaRDI QIDQ2214313
C. R. Subramanian, N. R. Aravind
Publication date: 8 December 2020
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2173
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Cites Work
- Unnamed Item
- Asymptotically optimal frugal colouring
- Boxicity of graphs with bounded degree
- Interval representations of planar graphs
- On dimensional properties of graphs
- A note on circular dimension
- On grid intersection graphs
- The circular dimension of a graph
- Colouring a graph frugally
- Intersection dimensions of graph classes
- Coloring with no 2-colored \(P_4\)'s
- Algorithmic graph theory and perfect graphs
- Forbidden subgraph colorings and the oriented chromatic number
- Boxicity and maximum degree
- Boxicity and treewidth
- Bounds on Edge Colorings with Restrictions on the Union of Color Classes
- Bounds on vertex colorings with restrictions on the union of color classes
- Star coloring of graphs
- Acyclic coloring of graphs
- Graph Classes: A Survey
- Coloring parameters for graphs on surfaces
- Boxicity and Poset Dimension
This page was built for publication: Intersection dimension and graph invariants
