Medial graph

In the mathematical discipline of graph theory, the medial graph of plane graph G is another graph M(G) that represents the adjacencies between edges… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1988-2017
024619882017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
It is well known that a plane graph is Eulerian if and only if its geometric dual is bipartite. We extend this result to partial… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
We consider two operations on an edge of an embedded graph (or equivalently a ribbon graph): giving a half-twist to the edge, and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Let G be a 3-connected planar graph and G∗ be its dual. We show that the pathwidth of G∗ is at most 6 times the pathwidth of G… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Review
2007
Review
2007
In any abstract 4-polytope P , the faces of ranks 1 and 2 constitute, in a natural way, the vertices of a medial layer graph G… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
The vertex-nullity interlace polynomial of a graph, described by Arratia, Bollobás and Sorkin in [ABS00] as evolving from… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
A straight ahead walk in an embedded Eulerian graph G always passes from an edge to the opposite edge in the rotation at the same… (More)
Is this relevant?
2004
2004
A subgroup G of automorphisms of a graph X is said to be 2 -arc-transitive if it is vertexand edgebut not arc-transitive. The… (More)
  • figure 1
  • figure 2
Is this relevant?
1989
1989
This paper introduces a generalization of the Tutte polynomial [14] that is defined for signed graphs. A signed graph is a graph… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
1988
1988
Let t(G, x, y) be the Tutte polynomial (or dichromate) of the connected plane graph G. It is known (Martin, Thesis, Grenoble… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?