<ruby id="d9npn"></ruby>

<sub id="d9npn"><progress id="d9npn"></progress></sub>

<nobr id="d9npn"></nobr>

<rp id="d9npn"><big id="d9npn"><th id="d9npn"></th></big></rp>

<th id="d9npn"><meter id="d9npn"></meter></th>

# Questions tagged [graph-theory]

Questions about the branch of combinatorics called graph theory (not to be used for questions concerning the graph of a function). This tag can be further specialized via using it in combination with more specialized tags such as extremal-graph-theory, spectral-graph-theory, algebraic-graph-theory, topological-graph-theory, random-graphs, graph-colorings and several others.

3,464 questions
43 views

### Are contraction-sensitive graphs necessarily vertex-transitive?

We say that a finite, simple, undirected graph $G=(V,E)$ is contraction-sensitive if collapsing any $2$ non-adjacent points increases the Hadwiger number. An example of such a graph is the icosahedron....
92 views

### Does any long path in a planar graph contain one of O(n) k-tuple of vertices?

My question is a bit related to both the container method and shallow cell complexity. Let's start with that the number of length $\ell$ paths (where $\ell$ denotes the number of vertices of the path!)...
37 views
+50

### Does the bounded branching/log depth dihotomy hold for rooted trees?

Let $T$ be a rooted tree. For any subtree $T' \subset T$ define its leaf-weight $lw$ as the number of leaves of $T'$. Further, for $T' \subset T$ define the branch-depth of a node $v \in T'$ as the ...
48 views

### Reference request: $n$-edge-coloring bipartite graph $K_{n,n}$ such that monochromatic parts are isomorphic

I am finding references for the following problem: We call a $n\times n$ 0-1 matrix permutation if there are exactly one $1$ in each row/column. Suppose $A$ is a 0-1 matrix of size $n\times n$ in ...
74 views

### Ear decompositions and spanning trees

I am looking for a reference for the following theorem: Theorem: Let $G$ be a 2-connected, simple, undirected graph, and let $T$ be a spanning tree. Then $G$ has an ear decomposition in which every ...
143 views

25 views

### Succinct circuits and NEXPTIME-complete problems

I am fascinated by a recent fact I was reading: Succinct Circuits are simple machines used to descibe graphs in exponentially less space, which leads to the downside that solving a problem on that ...
41 views

### Fastest Algorithm to calculate Graph pebbling number?

I am interested in Graph Pebbling, and in particular what are the fastest known algorithm is to find the pebbling number of a graph. Also, i am interested whether there are lower limits on the runtime ...
26 views

I need to efficiently determine in a complete weighted graph $G$ the sequence of triangles according to descending order of circumferences. My idea would be to incrementally construct a new graph $... 0answers 74 views ### Are all even regular undirected Cayley graphs of Class 1? Are even order Cayley graphs of Class 1, that is, can they be edge-colored with exactly$m$colors, where$m\$ is the degree of each vertex? I think yes, because of the symmetry the Cayley graphs ...

15 30 50 per page
特码生肖图
<ruby id="d9npn"></ruby>

<sub id="d9npn"><progress id="d9npn"></progress></sub>

<nobr id="d9npn"></nobr>

<rp id="d9npn"><big id="d9npn"><th id="d9npn"></th></big></rp>

<th id="d9npn"><meter id="d9npn"></meter></th>

<ruby id="d9npn"></ruby>

<sub id="d9npn"><progress id="d9npn"></progress></sub>

<nobr id="d9npn"></nobr>

<rp id="d9npn"><big id="d9npn"><th id="d9npn"></th></big></rp>

<th id="d9npn"><meter id="d9npn"></meter></th>