The following pages link to Graphs and Combinatorics (Q185060):
Displaying 50 items.
- Two conjectures on graceful digraphs (Q354413) (← links)
- On modular edge-graceful graphs (Q354418) (← links)
- Bounds on the 2-rainbow domination number of graphs (Q354420) (← links)
- Every cycle-connected multipartite tournament with \(\delta\geq 2\) contains at least two universal ARCS (Q354423) (← links)
- An Ore-type theorem on Hamiltonian square cycles (Q354425) (← links)
- Silver block intersection graphs of Steiner 2-designs (Q354426) (← links)
- A note on semi-coloring of graphs (Q354428) (← links)
- \([1,1,t]\)-colorings of complete graphs (Q354429) (← links)
- Nonisomorphic maximum packing and minimum covering of \(K_v\) with 8-cycles (Q354432) (← links)
- An infinite family of planar hypohamiltonian oriented graphs (Q354434) (← links)
- Group connectivity of bridged graphs (Q354436) (← links)
- Upper bounds on the paired domination subdivision number of a graph (Q354438) (← links)
- The planar slope number of planar partial 3-trees of bounded degree (Q354442) (← links)
- Sufficient condition for the existence of an even \([a,b]\)-factor in graph (Q354444) (← links)
- Embedding 1-factorizations of \(K_n\) in \(PG(2,32)\) (Q354447) (← links)
- Exact mixing times for random walks on trees (Q354448) (← links)
- \(H\)-kernels in infinite digraphs (Q354449) (← links)
- Degree sum conditions for cyclability in bipartite graphs (Q354452) (← links)
- Level Eulerian posets. (Q354454) (← links)
- Cyclic vertex-connectivity of Cayley graphs generated by transposition trees (Q354456) (← links)
- Linear coloring of planar graphs without 4-cycles (Q354457) (← links)
- Some inversion formulas and formulas for Stirling numbers (Q354459) (← links)
- Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\) (Q354461) (← links)
- Connectivity of the generalised Mycielskian of digraphs (Q354463) (← links)
- On the cycle spectrum of cubic Hamiltonian graphs (Q354467) (← links)
- Some results on weighted graphs without induced cycles of nonpositive weights (Q354469) (← links)
- Dihedral biembeddings and triangulations by complete and complete tripartite graphs (Q354470) (← links)
- Bipartite distance-transitive doubles with primitive halved of diameter two (Q367038) (← links)
- Planar point sets with large minimum convex decompositions (Q367041) (← links)
- On the edge connectivity of direct products with dense graphs (Q367042) (← links)
- On planar Toeplitz graphs (Q367045) (← links)
- Generalizations of Wiener polarity index and terminal Wiener index (Q367047) (← links)
- On minimum saturated matrices (Q367048) (← links)
- On the size of graphs of class 2 whose cores have maximum degree two (Q367049) (← links)
- Saturating Sperner families (Q367051) (← links)
- Graphs with few matching roots (Q367053) (← links)
- A generalization of Opsut's lower bounds for the competition number of a graph (Q367054) (← links)
- The domination polynomial of a graph at \(-1\) (Q367055) (← links)
- An upper bound for the total restrained domination number of graphs (Q367057) (← links)
- On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids (Q367058) (← links)
- Large chromatic number and Ramsey graphs (Q367059) (← links)
- Iterated joining of rooted trees (Q367061) (← links)
- On distance between graphs (Q367064) (← links)
- Universal \(H\)-colourable graphs (Q367065) (← links)
- Ascending subgraph decompositions in oriented complete balanced tripartite graphs (Q367066) (← links)
- Helly numbers of polyominoes (Q367067) (← links)
- The edge rotation graph (Q367068) (← links)
- Rainbow connection in 3-connected graphs (Q367069) (← links)
- Planar lattice graphs with Gallai's property (Q367072) (← links)
- Neighbor sum distinguishing index (Q367074) (← links)
