page_title: Ljubljana graph
hierarchical_section_title: Ljubljana graph
caption_attribution_description: A drawing of the Ljubljana graph with a Heawood graph layout
context_page_description: In the mathematical field of graph theory, the Ljubljana graph is an undirected bipartite graph with 112 vertices and 168 edges.
  It is a cubic graph with diameter 8, radius 7, chromatic number 2 and chromatic index 3. Its girth is 10 and there are exactly 168 cycles of length 10 in it. There are also 168 cycles of length 12.
context_section_description: In the mathematical field of graph theory, the Ljubljana graph is an undirected bipartite graph with 112 vertices and 168 edges. 
  It is a cubic graph with diameter 8, radius 7, chromatic number 2 and chromatic index 3. Its girth is 10 and there are exactly 168 cycles of length 10 in it. There are also 168 cycles of length 12.
caption: The Ljubljana graph as a covering graph of the Heawood graph
exif: {}