Find link

language:

Find link is a tool written by Edward Betts.

searching for Graphs and Combinatorics 45 found (111 total)

alternate case: graphs and Combinatorics

Najiba Sbihi (359 words) [view diff] exact match in snippet view article find links to article

William; Reed, Bruce (June 2007), "Vašek Chvátal: A Very Short Introduction" (PDF), Graphs and Combinatorics, 23 (S1): 41–65, doi:10.1007/s00373-007-0721-4

Integral graph (416 words) [view diff] exact match in snippet view article find links to article

have integral spectra?", in Bari, Ruth A.; Harary, Frank (eds.), Graphs and Combinatorics: Proceedings of the Capital Conference on Graph Theory and Combinatorics

Null graph (516 words) [view diff] exact match in snippet view article find links to article

and Read, R. (1973), "Is the null graph a pointless concept?", Graphs and Combinatorics (Conference, George Washington University), Springer-Verlag, New

Necklace problem (565 words) [view diff] exact match in snippet view article find links to article

and its applications". In Bari, Ruth A.; Harary, Frank (eds.). Graphs and Combinatorics: Proceedings of the Capital Conference on Graph Theory and Combinatorics

Ronald Gould (mathematician) (234 words) [view diff] exact match in snippet view article

(2013). "Recent Advances on the Hamiltonian Problem: Survey III". Graphs and Combinatorics. 30 (1): 1–46. doi:10.1007/s00373-013-1377-x. ISSN 0911-0119. MR 3143857

Planar graph (4,541 words) [view diff] exact match in snippet view article find links to article

G. (2006), "Planar Graphs, via Well-Orderly Maps and Trees", Graphs and Combinatorics, 22 (2): 185–202, CiteSeerX 10.1.1.106.7456, doi:10.1007/s00373-006-0647-2

Judith Q. Longyear (306 words) [view diff] exact match in snippet view article find links to article

configurations: An introduction". In Bari, Ruth A.; Harary, Frank (eds.). Graphs and Combinatorics: Proceedings of the Capital Conference on Graph Theory and Combinatorics

Perfect matching (949 words) [view diff] exact match in snippet view article find links to article

Jinjiang (2015-09-01). "On Graphs with a Unique Perfect Matching". Graphs and Combinatorics. 31 (5): 1765–1777. doi:10.1007/s00373-014-1463-8. ISSN 1435-5914

Nash-Williams theorem (567 words) [view diff] exact match in snippet view article find links to article

proof of Nash-Williams' theorem for the arboricity of a graph". Graphs and Combinatorics. 10 (1): 27–28. doi:10.1007/BF01202467. ISSN 1435-5914. S2CID 206791653

Cameron graph (200 words) [view diff] exact match in snippet view article find links to article

"Uniqueness and nonexistence of some graphs related to M22" (PDF), Graphs and Combinatorics, 2 (1): 21–29, doi:10.1007/BF01788073, MR 1117128 Crnković, Dean;

Grötzsch graph (980 words) [view diff] case mismatch in snippet view article find links to article

Chvátal, Vašek (1974), "The minimality of the Mycielski graph", Graphs and combinatorics (Proc. Capital Conf., George Washington Univ., Washington, D.C

Bipartite hypergraph (852 words) [view diff] exact match in snippet view article find links to article

Aharoni, Ron (1985-12-01). "Matchings inn-partiten-graphs". Graphs and Combinatorics. 1 (1): 303–304. doi:10.1007/BF02582958. ISSN 1435-5914. S2CID 19258298

Deltahedron (1,558 words) [view diff] exact match in snippet view article find links to article

(2021), "On Polyhedral Realization with Isosceles Triangles", Graphs and Combinatorics, 37 (4), Springer: 1247–1269, arXiv:2009.00116, doi:10.1007/s00373-021-02314-9

Mycielskian (1,096 words) [view diff] exact match in snippet view article find links to article

Chvátal, Vašek (1974), "The minimality of the Mycielski graph", Graphs and Combinatorics (Proc. Capital Conf., George Washington Univ., Washington, D.C

Rectangle packing (949 words) [view diff] exact match in snippet view article find links to article

Matching, and Polyomino Packing: Connections and Complexity". Graphs and Combinatorics. 23 (1): 195–208. doi:10.1007/s00373-007-0713-4. ISSN 1435-5914

Second neighborhood problem (927 words) [view diff] exact match in snippet view article find links to article

number of Seymour vertices in random tournaments and digraphs", Graphs and Combinatorics, 32 (5): 1805–1816, arXiv:1502.04061, doi:10.1007/s00373-015-1672-9

Layered permutation (615 words) [view diff] exact match in snippet view article find links to article

"Bounds on superpatterns containing all layered permutations", Graphs and Combinatorics, 31 (4): 941–952, doi:10.1007/s00373-014-1429-x, MR 3357666 Egge

Linear arboricity (863 words) [view diff] exact match in snippet view article find links to article

"Linear arboricity and linear k-arboricity of regular graphs", Graphs and Combinatorics, 17 (1): 11–16, doi:10.1007/PL00007233, MR 1828624. Péroche, B

Sidorenko's conjecture (2,644 words) [view diff] exact match in snippet view article find links to article

Alexander (1993), "A correlation inequality for bipartite graphs", Graphs and Combinatorics, 9 (2–4): 201–204, doi:10.1007/BF02988307, S2CID 12233056 Szegedy

Forcing graph (854 words) [view diff] exact match in snippet view article find links to article

Lubos (2004-06-01). "Bipartite Subgraphs and Quasi-Randomness". Graphs and Combinatorics. 20 (2): 255–262. doi:10.1007/s00373-004-0556-1. ISSN 0911-0119

Pairwise compatibility graph (473 words) [view diff] exact match in snippet view article find links to article

pairwise compatibility graphs". AKCE International Journal of Graphs and Combinatorics. 17 (3): 788–795. doi:10.1016/j.akcej.2019.12.011. S2CID 225708614

Isabel Hubard Escalera (964 words) [view diff] exact match in snippet view article find links to article

Primož (2015). "Classification of symmetric Tabačjn graphs". Graphs and Combinatorics. 31 (5): 1137–1153. doi:10.1007/s00373-014-1447-8. Hubard, Isabel;

Reconstruction conjecture (1,820 words) [view diff] exact match in snippet view article find links to article

Harary, F. (1974), "A survey of the reconstruction conjecture", Graphs and Combinatorics, Lecture Notes in Mathematics, vol. 406, Springer, pp. 18–28, doi:10

Herschel graph (1,617 words) [view diff] exact match in snippet view article find links to article

"Minimal k {\displaystyle k} -connected non-Hamiltonian graphs", Graphs and Combinatorics, 34 (2): 289–312, doi:10.1007/s00373-018-1874-z, MR 3774453, S2CID 253891751

Steinhaus chessboard theorem (510 words) [view diff] exact match in snippet view article find links to article

(2019-03-01). "On Rooks, Marriages, and Matchings or Steinhaus via Hall". Graphs and Combinatorics. 35 (2): 503–511. doi:10.1007/s00373-019-02015-4. ISSN 1435-5914

Triangle-free graph (2,524 words) [view diff] case mismatch in snippet view article find links to article

Chvátal, Vašek (1974), "The minimality of the Mycielski graph", Graphs and combinatorics (Proc. Capital Conf., George Washington Univ., Washington, D.C

Mirka Miller (902 words) [view diff] exact match in snippet view article find links to article

Miller 09-05-1949 : 02-01-2016", AKCE International Journal of Graphs and Combinatorics, 13 (2): 210–211, doi:10.1016/s0972-8600(16)30114-1 Curriculum

Hall-type theorems for hypergraphs (6,498 words) [view diff] exact match in snippet view article find links to article

technology. Aharoni, Ron (1985-12-01). "Matchings inn-partiten-graphs". Graphs and Combinatorics. 1 (1): 303–304. doi:10.1007/BF02582958. ISSN 1435-5914. S2CID 19258298

Χ-bounded (1,522 words) [view diff] exact match in snippet view article find links to article

"Vizing bound for the chromatic number on some graph classes", Graphs and Combinatorics, 32 (4): 1447–1460, doi:10.1007/s00373-015-1651-1, MR 3514976,

Sparsity matroid (3,459 words) [view diff] exact match in snippet view article find links to article

2)-dimensional panels inn-space I: (k − 1,k)-graphs and (k − 1,k)-frames". Graphs and Combinatorics. 7 (3): 289–304. doi:10.1007/BF01787636. ISSN 1435-5914. S2CID 40089590

National Institute of Statistics and Applied Economics (1,581 words) [view diff] exact match in snippet view article find links to article

preparation of OR in the following areas: Combinatorial optimization, Graphs and Combinatorics and Discrete Mathematics. Through cross-training acquired in INSEA

3-partition problem (2,259 words) [view diff] exact match in snippet view article find links to article

Matching, and Polyomino Packing: Connections and Complexity". Graphs and Combinatorics. 23 (S1): 195–208. doi:10.1007/s00373-007-0713-4. ISSN 0911-0119

Graphs with few cliques (963 words) [view diff] exact match in snippet view article find links to article

Wood, D. R. (2007). On the Maximum Number of Cliques in a Graph. Graphs and Combinatorics, 23(3), 337–352. https://doi.org/10.1007/s00373-007-0738-8 Spinrad

Tuza's conjecture (809 words) [view diff] exact match in snippet view article find links to article

lemma Tuza, Zsolt (1990), "A conjecture on triangles of graphs", Graphs and Combinatorics, 6 (4): 373–380, doi:10.1007/BF01787705, MR 1092587 Lawler, Eugene

Perfect matching in high-degree hypergraphs (1,846 words) [view diff] exact match in snippet view article find links to article

Matchings and K 4 3 -Tilings in Hypergraphs of Large Codegree". Graphs and Combinatorics. 24 (4): 391–404. doi:10.1007/s00373-008-0787-7. ISSN 0911-0119

Polyomino (4,560 words) [view diff] exact match in snippet view article find links to article

Matching, and Polyomino Packing: Connections and Complexity". Graphs and Combinatorics. 23: 195–208. doi:10.1007/s00373-007-0713-4. S2CID 17190810. S

Quantum t-design (2,477 words) [view diff] exact match in snippet view article find links to article

Bajnok, Béla (1998-06-05). "Constructions of Spherical 3-Designs". Graphs and Combinatorics. 14 (2): 97–107. arXiv:2404.15544. doi:10.1007/PL00007220. ISSN 0911-0119

Hypergraph removal lemma (2,349 words) [view diff] exact match in snippet view article find links to article

Rödl, V. (December 1992). "The Uniformity Lemma for hypergraphs". Graphs and Combinatorics. 8 (4): 309–312. doi:10.1007/bf02351586. ISSN 0911-0119. Nagle

No-three-in-line problem (3,842 words) [view diff] exact match in snippet view article find links to article

(2018). "On no-three-in-line problem on m-dimensional torus". Graphs and Combinatorics. 34 (2): 355–364. doi:10.1007/s00373-018-1878-8. MR 3774457. S2CID 3935268

Stochastic transitivity (1,839 words) [view diff] exact match in snippet view article find links to article

1988). "Stronger players win more balanced knockout tournaments". Graphs and Combinatorics. 4 (1): 95–99. doi:10.1007/bf01864157. ISSN 0911-0119. S2CID 44602228

Perfect graph (7,055 words) [view diff] exact match in snippet view article find links to article

"Recent results on trees". In Bari, Ruth A.; Harary, Frank (eds.). Graphs and Combinatorics: Proceedings of the Capital Conference on Graph Theory and Combinatorics

Graph removal lemma (5,077 words) [view diff] exact match in snippet view article find links to article

fixed subgraph and a problem for hypergraphs having no exponent", Graphs and Combinatorics, 2 (2): 113–121, doi:10.1007/BF01788085, MR 0932119, S2CID 16839886

Book embedding (8,167 words) [view diff] exact match in snippet view article find links to article

topological graph theory", in Bari, Ruth A.; Harary, Frank (eds.), Graphs and Combinatorics (Proceedings of the Capital Conference on Graph Theory and Combinatorics

Italo Jose Dejter (5,660 words) [view diff] exact match in snippet view article find links to article

Hoffman D. G.; Lindner C. C. "Almost resolvable maximum packings of complete graphs with 4-cycles", Graphs and Combinatorics, 27 (2011), no. 2, 161-170

Geiringer–Laman theorem (5,841 words) [view diff] exact match in snippet view article find links to article

Tay, Tiong-Seng (1993-06-01). "A new proof of laman's theorem". Graphs and Combinatorics. 9 (2): 365–370. doi:10.1007/BF02988323. ISSN 1435-5914. S2CID 40384855