The following pages link to Graphs and Combinatorics (Q185060):
Displaying 50 items.
- The removable edges and the contractible subgraphs of 5-connected graphs (Q489362) (← links)
- The minimal number of subtrees of a tree (Q489363) (← links)
- Orientations of graphs with prescribed weighted out-degrees (Q489364) (← links)
- Convex pentagons for edge-to-edge tiling. II (Q489365) (← links)
- Two formulas of 2-color off-diagonal Rado numbers (Q489366) (← links)
- The minimal number of subtrees with a given degree sequence (Q489367) (← links)
- Two disjoint independent bases in matroid-graph pairs (Q497297) (← links)
- Note on distance magic products \(G\circ C_4\) (Q497298) (← links)
- Distance magic labeling and two products of graphs (Q497299) (← links)
- Classification of symmetric Tabačjn graphs (Q497303) (← links)
- Tutte polynomials and a stronger version of the Akiyama-Harary problem (Q497304) (← links)
- Total domination edge critical graphs with total domination number three and many dominating pairs (Q497305) (← links)
- Facial parity 9-edge-coloring of outerplane graphs (Q497307) (← links)
- Non-minimal degree-sequence-forcing triples (Q497308) (← links)
- A bivariate chromatic polynomial for signed graphs (Q497310) (← links)
- Critically twin primitive 2-structures (Q497313) (← links)
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull (Q497314) (← links)
- On Cartesian products having a minimum dominating set that is a box or a stairway (Q497315) (← links)
- Blocking the \(k\)-holes of point sets in the plane (Q497316) (← links)
- Existence of Yang Hui type magic squares (Q497319) (← links)
- Planarity and hyperbolicity in graphs (Q497320) (← links)
- Sum-paintability of generalized theta-graphs (Q497323) (← links)
- Erdős-Pyber theorem for hypergraphs and secret sharing (Q497325) (← links)
- On bounds for the product irregularity strength of graphs (Q497327) (← links)
- On the complexity of deciding whether the regular number is at most two (Q497328) (← links)
- A note on the inducibility of 4-vertex graphs (Q497330) (← links)
- Binary codes and partial permutation decoding sets from the Johnson graphs (Q497331) (← links)
- The existence of semi-colorings in a graph (Q497333) (← links)
- Projective equivalences of \(k\)-neighbourly polytopes (Q497336) (← links)
- Permanental bounds of the Laplacian matrix of trees with given domination number (Q497337) (← links)
- On locally Gabriel geometric graphs (Q497339) (← links)
- Total version of the domination game (Q497340) (← links)
- The Dilworth number of auto-chordal bipartite graphs (Q497341) (← links)
- The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edges (Q497342) (← links)
- The backbone coloring problem for bipartite backbones (Q497343) (← links)
- Distance constraints on short cycles for 3-colorability of planar graphs (Q497344) (← links)
- Union-intersecting set systems (Q497346) (← links)
- Uniform estimates of nonlinear spectral gaps (Q497347) (← links)
- Group chromatic number of Halin graphs (Q497348) (← links)
- Generalizing vertex pancyclic and \(k\)-ordered graphs (Q497349) (← links)
- Parity subgraphs with few common edges and nowhere-zero 5-flow (Q497352) (← links)
- A structural approach for independent domination of regular graphs (Q497353) (← links)
- On the spectra of simplicial rook graphs (Q497355) (← links)
- Towards the characterization of finite homomorphism-homogeneous oriented graphs with loops (Q497356) (← links)
- Asymptotic bounds on the equilateral dimension of hypercubes (Q497358) (← links)
- Minimum many-to-many matchings for computing the distance between two sequences (Q497361) (← links)
- Polynomial time recognition of essential graphs having stability number equal to matching number (Q497363) (← links)
- Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs (Q497365) (← links)
- A toughness condition for a spanning tree with bounded total excesses (Q497366) (← links)
- On bounding the difference of the maximum degree and the clique number (Q497368) (← links)
