Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for +publisher:"University of Illinois – Urbana-Champaign" +contributor:("Kostochka, Alexandr"). Showing records 1 – 30 of 37 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

Department

▼ Search Limiters


University of Illinois – Urbana-Champaign

1. Kim, Jaehoon. Extremal problems involving forbidden subgraphs.

Degree: PhD, 0439, 2014, University of Illinois – Urbana-Champaign

 In this thesis, we study extremal problems involving forbidden subgraphs. We are interested in extremal problems over a family of graphs or over a family… (more)

Subjects/Keywords: Extremal Graph Theory; Graphs; Graph Coloring; Hypergraphs; Forbidden Subgraphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kim, J. (2014). Extremal problems involving forbidden subgraphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/49480

Chicago Manual of Style (16th Edition):

Kim, Jaehoon. “Extremal problems involving forbidden subgraphs.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/49480.

MLA Handbook (7th Edition):

Kim, Jaehoon. “Extremal problems involving forbidden subgraphs.” 2014. Web. 11 Jul 2020.

Vancouver:

Kim J. Extremal problems involving forbidden subgraphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/49480.

Council of Science Editors:

Kim J. Extremal problems involving forbidden subgraphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/49480


University of Illinois – Urbana-Champaign

2. Wagner, Zsolt Adam. On some problems in extremal, probabilistic and enumerative combinatorics.

Degree: PhD, Mathematics, 2018, University of Illinois – Urbana-Champaign

 This is a study of a small selection of problems from various areas of Combinatorics and Graph Theory, a fast developing field that provides a… (more)

Subjects/Keywords: extremal combinatorics; probabilistic combinatorics; enumerative combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wagner, Z. A. (2018). On some problems in extremal, probabilistic and enumerative combinatorics. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/100954

Chicago Manual of Style (16th Edition):

Wagner, Zsolt Adam. “On some problems in extremal, probabilistic and enumerative combinatorics.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/100954.

MLA Handbook (7th Edition):

Wagner, Zsolt Adam. “On some problems in extremal, probabilistic and enumerative combinatorics.” 2018. Web. 11 Jul 2020.

Vancouver:

Wagner ZA. On some problems in extremal, probabilistic and enumerative combinatorics. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/100954.

Council of Science Editors:

Wagner ZA. On some problems in extremal, probabilistic and enumerative combinatorics. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/100954


University of Illinois – Urbana-Champaign

3. Liu, Hong. Extremal graph theory: supersaturation and enumeration.

Degree: PhD, Mathematics, 2015, University of Illinois – Urbana-Champaign

 In this thesis, we study supersaturation and enumeration problems in extremal combinatorics. In Chapter 2, with Balogh, we disprove a conjecture of Erdos and Tuza… (more)

Subjects/Keywords: Supersaturation; Enumeration; Typical Structure; Extremal Combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Liu, H. (2015). Extremal graph theory: supersaturation and enumeration. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/89148

Chicago Manual of Style (16th Edition):

Liu, Hong. “Extremal graph theory: supersaturation and enumeration.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/89148.

MLA Handbook (7th Edition):

Liu, Hong. “Extremal graph theory: supersaturation and enumeration.” 2015. Web. 11 Jul 2020.

Vancouver:

Liu H. Extremal graph theory: supersaturation and enumeration. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/89148.

Council of Science Editors:

Liu H. Extremal graph theory: supersaturation and enumeration. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/89148


University of Illinois – Urbana-Champaign

4. Wise, Jennifer Irene. Games on graphs, visibility representations, and graph colorings.

Degree: PhD, Mathematics, 2016, University of Illinois – Urbana-Champaign

 In this thesis we study combinatorial games on graphs and some graph parameters whose consideration was inspired by an interest in the symmetry of hypercubes.… (more)

Subjects/Keywords: Graphs; Game Matching; Game $f$-Matching; Fool's Solitaire; Bar Visibility Representations; $r$-Dynamic Coloring; Antipodal Edge-Coloring; $A$-Cordial Labeling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wise, J. I. (2016). Games on graphs, visibility representations, and graph colorings. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/92697

Chicago Manual of Style (16th Edition):

Wise, Jennifer Irene. “Games on graphs, visibility representations, and graph colorings.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/92697.

MLA Handbook (7th Edition):

Wise, Jennifer Irene. “Games on graphs, visibility representations, and graph colorings.” 2016. Web. 11 Jul 2020.

Vancouver:

Wise JI. Games on graphs, visibility representations, and graph colorings. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/92697.

Council of Science Editors:

Wise JI. Games on graphs, visibility representations, and graph colorings. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/92697


University of Illinois – Urbana-Champaign

5. Sharifzadeh, Maryam. Embedding problems and Ramsey-Turán variations in extremal graph theory.

Degree: PhD, Mathematics, 2016, University of Illinois – Urbana-Champaign

 In this dissertation, we will focus on a few problems in extremal graph theory. The first chapter consists of some basic terms and tools. In… (more)

Subjects/Keywords: Combinatorics; Graph; Ramsey-Turan

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sharifzadeh, M. (2016). Embedding problems and Ramsey-Turán variations in extremal graph theory. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/93041

Chicago Manual of Style (16th Edition):

Sharifzadeh, Maryam. “Embedding problems and Ramsey-Turán variations in extremal graph theory.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/93041.

MLA Handbook (7th Edition):

Sharifzadeh, Maryam. “Embedding problems and Ramsey-Turán variations in extremal graph theory.” 2016. Web. 11 Jul 2020.

Vancouver:

Sharifzadeh M. Embedding problems and Ramsey-Turán variations in extremal graph theory. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/93041.

Council of Science Editors:

Sharifzadeh M. Embedding problems and Ramsey-Turán variations in extremal graph theory. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/93041


University of Illinois – Urbana-Champaign

6. Jahanbekam, Sogol. Extremal problems for labelling of graphs and distance in digraphs.

Degree: PhD, 0439, 2013, University of Illinois – Urbana-Champaign

 We study several extremal problems in graph labelling and in weak diameter of digraphs. In Chapter 2 we apply the Discharging Method to prove the… (more)

Subjects/Keywords: Graph Coloring; Graph Labelling; Ramsey Numbers; AntiRamsey Graph Theory; Weak Diameter in Digraphs; Matching in Graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Jahanbekam, S. (2013). Extremal problems for labelling of graphs and distance in digraphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/45527

Chicago Manual of Style (16th Edition):

Jahanbekam, Sogol. “Extremal problems for labelling of graphs and distance in digraphs.” 2013. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/45527.

MLA Handbook (7th Edition):

Jahanbekam, Sogol. “Extremal problems for labelling of graphs and distance in digraphs.” 2013. Web. 11 Jul 2020.

Vancouver:

Jahanbekam S. Extremal problems for labelling of graphs and distance in digraphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2013. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/45527.

Council of Science Editors:

Jahanbekam S. Extremal problems for labelling of graphs and distance in digraphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/45527


University of Illinois – Urbana-Champaign

7. Reiniger, Benjamin M. Coloring and constructing (hyper)graphs with restrictions.

Degree: PhD, Mathematics, 2015, University of Illinois – Urbana-Champaign

 We consider questions regarding the existence of graphs and hypergraphs with certain coloring properties and other structural properties. In Chapter 2 we consider color-critical graphs… (more)

Subjects/Keywords: graph coloring; hypergraph coloring; critical graphs; list coloring; hypergraph degrees; poset dimension

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Reiniger, B. M. (2015). Coloring and constructing (hyper)graphs with restrictions. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/87975

Chicago Manual of Style (16th Edition):

Reiniger, Benjamin M. “Coloring and constructing (hyper)graphs with restrictions.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/87975.

MLA Handbook (7th Edition):

Reiniger, Benjamin M. “Coloring and constructing (hyper)graphs with restrictions.” 2015. Web. 11 Jul 2020.

Vancouver:

Reiniger BM. Coloring and constructing (hyper)graphs with restrictions. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/87975.

Council of Science Editors:

Reiniger BM. Coloring and constructing (hyper)graphs with restrictions. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/87975


University of Illinois – Urbana-Champaign

8. Kantor, Ida. Graphs, codes, and colorings.

Degree: PhD, 0439, 2011, University of Illinois – Urbana-Champaign

 \noindent{This thesis focuses on topics in extremal combinatorics.} Given an integer-valued function f defined on the vertices of a graph G, we say G is… (more)

Subjects/Keywords: sum choice number; list coloring; product dimension; graph representation; codes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kantor, I. (2011). Graphs, codes, and colorings. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/18247

Chicago Manual of Style (16th Edition):

Kantor, Ida. “Graphs, codes, and colorings.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/18247.

MLA Handbook (7th Edition):

Kantor, Ida. “Graphs, codes, and colorings.” 2011. Web. 11 Jul 2020.

Vancouver:

Kantor I. Graphs, codes, and colorings. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/18247.

Council of Science Editors:

Kantor I. Graphs, codes, and colorings. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/18247


University of Illinois – Urbana-Champaign

9. Puleo, Gregory. Problems in list coloring, triangle covering, and pursuit-evasion games.

Degree: PhD, 0439, 2014, University of Illinois – Urbana-Champaign

 We study several problems in extremal graph theory. Chapter 2 studies Tuza's Conjecture, which states that if a graph G does not contain more than… (more)

Subjects/Keywords: Tuza's conjecture; packing and covering; list coloring; pursuit-evasion games; discharging; triangle packing; triangle covering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Puleo, G. (2014). Problems in list coloring, triangle covering, and pursuit-evasion games. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/50548

Chicago Manual of Style (16th Edition):

Puleo, Gregory. “Problems in list coloring, triangle covering, and pursuit-evasion games.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/50548.

MLA Handbook (7th Edition):

Puleo, Gregory. “Problems in list coloring, triangle covering, and pursuit-evasion games.” 2014. Web. 11 Jul 2020.

Vancouver:

Puleo G. Problems in list coloring, triangle covering, and pursuit-evasion games. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/50548.

Council of Science Editors:

Puleo G. Problems in list coloring, triangle covering, and pursuit-evasion games. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/50548


University of Illinois – Urbana-Champaign

10. Hu, Ping. Extremal graph theory: flag algebras, Ramsey-Turan numbers, chromatic thresholds, and sparse hypergraphs.

Degree: PhD, 0439, 2014, University of Illinois – Urbana-Champaign

 We study problems in extremal combinatorics motivated by Turan's Theorem and Ramsey Theory. In Chapter 2, we use Flag Algebras to study these problems. With… (more)

Subjects/Keywords: Flag Algebras; Ramsey; Turan; Chromatic Thresholds

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hu, P. (2014). Extremal graph theory: flag algebras, Ramsey-Turan numbers, chromatic thresholds, and sparse hypergraphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/50590

Chicago Manual of Style (16th Edition):

Hu, Ping. “Extremal graph theory: flag algebras, Ramsey-Turan numbers, chromatic thresholds, and sparse hypergraphs.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/50590.

MLA Handbook (7th Edition):

Hu, Ping. “Extremal graph theory: flag algebras, Ramsey-Turan numbers, chromatic thresholds, and sparse hypergraphs.” 2014. Web. 11 Jul 2020.

Vancouver:

Hu P. Extremal graph theory: flag algebras, Ramsey-Turan numbers, chromatic thresholds, and sparse hypergraphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/50590.

Council of Science Editors:

Hu P. Extremal graph theory: flag algebras, Ramsey-Turan numbers, chromatic thresholds, and sparse hypergraphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/50590


University of Illinois – Urbana-Champaign

11. O, Suil. Matchings, Connectivity, and Eigenvalues in Regular Graphs.

Degree: PhD, 0439, 2011, University of Illinois – Urbana-Champaign

 We study extremal and structural problems in regular graphs involving various parameters. In Chapter 2, we obtain the best lower bound for the matching number… (more)

Subjects/Keywords: Matching; Connectivity; Edge-connectivity; Eigenvalue; Regular graph; Postman; Path cover; Average (edge)-connectivity; Total Domination; Balloon; $r$-dynamic coloring

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

O, S. (2011). Matchings, Connectivity, and Eigenvalues in Regular Graphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/26034

Chicago Manual of Style (16th Edition):

O, Suil. “Matchings, Connectivity, and Eigenvalues in Regular Graphs.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/26034.

MLA Handbook (7th Edition):

O, Suil. “Matchings, Connectivity, and Eigenvalues in Regular Graphs.” 2011. Web. 11 Jul 2020.

Vancouver:

O S. Matchings, Connectivity, and Eigenvalues in Regular Graphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/26034.

Council of Science Editors:

O S. Matchings, Connectivity, and Eigenvalues in Regular Graphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/26034

12. Yancey, Matthew. Sparse color-critical graphs and rainbow matchings in edge-colored graphs.

Degree: PhD, 0439, 2013, University of Illinois – Urbana-Champaign

 This thesis focuses on extremal problems about coloring graphs and on finding rainbow matchings in edge-colored graphs. A graph G is k-{\em critical} if G… (more)

Subjects/Keywords: critical graphs; coloring sparse graphs; improper graph coloring; relaxed graph coloring

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yancey, M. (2013). Sparse color-critical graphs and rainbow matchings in edge-colored graphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/44365

Chicago Manual of Style (16th Edition):

Yancey, Matthew. “Sparse color-critical graphs and rainbow matchings in edge-colored graphs.” 2013. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/44365.

MLA Handbook (7th Edition):

Yancey, Matthew. “Sparse color-critical graphs and rainbow matchings in edge-colored graphs.” 2013. Web. 11 Jul 2020.

Vancouver:

Yancey M. Sparse color-critical graphs and rainbow matchings in edge-colored graphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2013. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/44365.

Council of Science Editors:

Yancey M. Sparse color-critical graphs and rainbow matchings in edge-colored graphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/44365

13. Choi, Ilkyoo. Extremal problems on variations of graph colorings.

Degree: PhD, 0439, 2014, University of Illinois – Urbana-Champaign

 This thesis investigates various coloring problems in graph theory. Graph coloring is an essential part of combinatorics and discrete mathematics, as it deals with the… (more)

Subjects/Keywords: Graph Theory; Graph Coloring; Choosability; List Chromatic Number; Discharging

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Choi, I. (2014). Extremal problems on variations of graph colorings. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/49578

Chicago Manual of Style (16th Edition):

Choi, Ilkyoo. “Extremal problems on variations of graph colorings.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/49578.

MLA Handbook (7th Edition):

Choi, Ilkyoo. “Extremal problems on variations of graph colorings.” 2014. Web. 11 Jul 2020.

Vancouver:

Choi I. Extremal problems on variations of graph colorings. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/49578.

Council of Science Editors:

Choi I. Extremal problems on variations of graph colorings. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/49578

14. Stocker, Christopher J. Covering and packing problems on graphs and hypergraphs.

Degree: PhD, 0439, 2011, University of Illinois – Urbana-Champaign

 In this thesis we consider several extremal problems for graphs and hypergraphs: packing, domination, and coloring. Graph packing problems have many applications to areas such… (more)

Subjects/Keywords: Packing; Domination; Acyclic Coloring

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Stocker, C. J. (2011). Covering and packing problems on graphs and hypergraphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/26316

Chicago Manual of Style (16th Edition):

Stocker, Christopher J. “Covering and packing problems on graphs and hypergraphs.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/26316.

MLA Handbook (7th Edition):

Stocker, Christopher J. “Covering and packing problems on graphs and hypergraphs.” 2011. Web. 11 Jul 2020.

Vancouver:

Stocker CJ. Covering and packing problems on graphs and hypergraphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/26316.

Council of Science Editors:

Stocker CJ. Covering and packing problems on graphs and hypergraphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/26316

15. Kumbhat, Mohit. Colorings and list colorings of graphs and hypergraphs.

Degree: PhD, 0439, 2012, University of Illinois – Urbana-Champaign

 In this thesis we study some extremal problems related to colorings and list colorings of graphs and hypergraphs. One of the main problems that we… (more)

Subjects/Keywords: Graph Coloring; List Coloring; Hypergraphs

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kumbhat, M. (2012). Colorings and list colorings of graphs and hypergraphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/30921

Chicago Manual of Style (16th Edition):

Kumbhat, Mohit. “Colorings and list colorings of graphs and hypergraphs.” 2012. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/30921.

MLA Handbook (7th Edition):

Kumbhat, Mohit. “Colorings and list colorings of graphs and hypergraphs.” 2012. Web. 11 Jul 2020.

Vancouver:

Kumbhat M. Colorings and list colorings of graphs and hypergraphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2012. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/30921.

Council of Science Editors:

Kumbhat M. Colorings and list colorings of graphs and hypergraphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/30921

16. Yager, Derrek Jordan Dinius. Sufficient degree conditions for graph embeddings.

Degree: PhD, Mathematics, 2019, University of Illinois – Urbana-Champaign

 In this dissertation, we focus on the sufficient conditions to guarantee one graph being the subgraph of another. In Chapter 2, we discuss list packing,… (more)

Subjects/Keywords: Combinatorics; Graph Theory; Extremal Graph Theory

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yager, D. J. D. (2019). Sufficient degree conditions for graph embeddings. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/105617

Chicago Manual of Style (16th Edition):

Yager, Derrek Jordan Dinius. “Sufficient degree conditions for graph embeddings.” 2019. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/105617.

MLA Handbook (7th Edition):

Yager, Derrek Jordan Dinius. “Sufficient degree conditions for graph embeddings.” 2019. Web. 11 Jul 2020.

Vancouver:

Yager DJD. Sufficient degree conditions for graph embeddings. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2019. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/105617.

Council of Science Editors:

Yager DJD. Sufficient degree conditions for graph embeddings. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2019. Available from: http://hdl.handle.net/2142/105617

17. Bernshteyn, Anton. Coloring problems in combinatorics and descriptive set theory.

Degree: PhD, Mathematics, 2018, University of Illinois – Urbana-Champaign

 In this dissertation we study problems related to colorings of combinatorial structures both in the “classical” finite context and in the framework of descriptive set… (more)

Subjects/Keywords: coloring; probabilistic method; Lovasz Local Lemma; graphs; hypergraphs; list coloring; DP-coloring; descriptive combinatorics; measurable dynamics; generic dynamics; symbolic dynamics; weak containment

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bernshteyn, A. (2018). Coloring problems in combinatorics and descriptive set theory. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/101454

Chicago Manual of Style (16th Edition):

Bernshteyn, Anton. “Coloring problems in combinatorics and descriptive set theory.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/101454.

MLA Handbook (7th Edition):

Bernshteyn, Anton. “Coloring problems in combinatorics and descriptive set theory.” 2018. Web. 11 Jul 2020.

Vancouver:

Bernshteyn A. Coloring problems in combinatorics and descriptive set theory. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/101454.

Council of Science Editors:

Bernshteyn A. Coloring problems in combinatorics and descriptive set theory. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/101454

18. Delcourt, Michelle Jeannette. Viewing extremal and structural problems through a probabilistic lens.

Degree: PhD, Mathematics, 2017, University of Illinois – Urbana-Champaign

 This thesis focuses on using techniques from probability to solve problems from extremal and structural combinatorics. The main problem in Chapter 2 is determining the… (more)

Subjects/Keywords: Small subgraph conditioning method; Random regular graph; Intersecting families; Star decomposition; Structural graph theory; Extremal combinatorcs

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Delcourt, M. J. (2017). Viewing extremal and structural problems through a probabilistic lens. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97669

Chicago Manual of Style (16th Edition):

Delcourt, Michelle Jeannette. “Viewing extremal and structural problems through a probabilistic lens.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/97669.

MLA Handbook (7th Edition):

Delcourt, Michelle Jeannette. “Viewing extremal and structural problems through a probabilistic lens.” 2017. Web. 11 Jul 2020.

Vancouver:

Delcourt MJ. Viewing extremal and structural problems through a probabilistic lens. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/97669.

Council of Science Editors:

Delcourt MJ. Viewing extremal and structural problems through a probabilistic lens. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97669

19. Loeb, Sarah Jane. Coloring and covering problems on graphs.

Degree: PhD, Mathematics, 2017, University of Illinois – Urbana-Champaign

 The \emph{separation dimension} of a graph G, written π(G), is the minimum number of linear orderings of V(G) such that every two nonincident edges are… (more)

Subjects/Keywords: Graph coloring; Graph covering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Loeb, S. J. (2017). Coloring and covering problems on graphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/98358

Chicago Manual of Style (16th Edition):

Loeb, Sarah Jane. “Coloring and covering problems on graphs.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/98358.

MLA Handbook (7th Edition):

Loeb, Sarah Jane. “Coloring and covering problems on graphs.” 2017. Web. 11 Jul 2020.

Vancouver:

Loeb SJ. Coloring and covering problems on graphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/98358.

Council of Science Editors:

Loeb SJ. Coloring and covering problems on graphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/98358

20. McConvey, Andrew Ross. Sufficient conditions for the existence of specified subgraphs in graphs.

Degree: PhD, Mathematics, 2017, University of Illinois – Urbana-Champaign

 A classical problem in combinatorics is, given graphs G and H, to determine if H is a subgraph of G. It is usually computationally complex… (more)

Subjects/Keywords: Combinatorics; Graph theory; Extremal graph theory; Cycles; Disjoint cycles; Graph packing; Turán number; List packing; Matching; Stable matching; Stable marriage

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Sample image

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

McConvey, A. R. (2017). Sufficient conditions for the existence of specified subgraphs in graphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97294

Chicago Manual of Style (16th Edition):

McConvey, Andrew Ross. “Sufficient conditions for the existence of specified subgraphs in graphs.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/97294.

MLA Handbook (7th Edition):

McConvey, Andrew Ross. “Sufficient conditions for the existence of specified subgraphs in graphs.” 2017. Web. 11 Jul 2020.

Vancouver:

McConvey AR. Sufficient conditions for the existence of specified subgraphs in graphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/97294.

Council of Science Editors:

McConvey AR. Sufficient conditions for the existence of specified subgraphs in graphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97294

21. Spinoza, Hannah R. On some problems in reconstruction.

Degree: PhD, Mathematics, 2016, University of Illinois – Urbana-Champaign

 A graph is {\it reconstructible} if it is determined by its {\it deck} of unlabeled subgraphs obtained by deleting one vertex; a {\it card} is… (more)

Subjects/Keywords: Graph theory; Reconstruction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Spinoza, H. R. (2016). On some problems in reconstruction. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/95378

Chicago Manual of Style (16th Edition):

Spinoza, Hannah R. “On some problems in reconstruction.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/95378.

MLA Handbook (7th Edition):

Spinoza, Hannah R. “On some problems in reconstruction.” 2016. Web. 11 Jul 2020.

Vancouver:

Spinoza HR. On some problems in reconstruction. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/95378.

Council of Science Editors:

Spinoza HR. On some problems in reconstruction. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/95378

22. Petrickova, Sarka. Extremal problems on counting combinatorial structures.

Degree: PhD, Mathematics, 2017, University of Illinois – Urbana-Champaign

 The fast developing field of extremal combinatorics provides a diverse spectrum of powerful tools with many applications to economics, computer science, and optimization theory. In… (more)

Subjects/Keywords: Extremal; Counting; Triangle-free; Maximal; Structure; Poset; Comparable pair; Chromatic number; Choosability

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Petrickova, S. (2017). Extremal problems on counting combinatorial structures. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97401

Chicago Manual of Style (16th Edition):

Petrickova, Sarka. “Extremal problems on counting combinatorial structures.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/97401.

MLA Handbook (7th Edition):

Petrickova, Sarka. “Extremal problems on counting combinatorial structures.” 2017. Web. 11 Jul 2020.

Vancouver:

Petrickova S. Extremal problems on counting combinatorial structures. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/97401.

Council of Science Editors:

Petrickova S. Extremal problems on counting combinatorial structures. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97401

23. Luo, Ruth. Extremal problems for cycles in graphs and hypergraphs.

Degree: PhD, Mathematics, 2019, University of Illinois – Urbana-Champaign

 In this thesis, we study several generalizations of Turan type problems in graphs and hypergraphs. In particular, we focus on graphs and hypergraphs without long… (more)

Subjects/Keywords: cycles; paths; Berge cycles; Berge paths; Turan problems; hypergraphs; extremal combinatorics; graph theory; hypergraph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Luo, R. (2019). Extremal problems for cycles in graphs and hypergraphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/105633

Chicago Manual of Style (16th Edition):

Luo, Ruth. “Extremal problems for cycles in graphs and hypergraphs.” 2019. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/105633.

MLA Handbook (7th Edition):

Luo, Ruth. “Extremal problems for cycles in graphs and hypergraphs.” 2019. Web. 11 Jul 2020.

Vancouver:

Luo R. Extremal problems for cycles in graphs and hypergraphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2019. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/105633.

Council of Science Editors:

Luo R. Extremal problems for cycles in graphs and hypergraphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2019. Available from: http://hdl.handle.net/2142/105633

24. Jao, Fang-Kai. On vertex degrees, graph decomposition, and circular chromatic Ramsey number.

Degree: PhD, 0439, 2013, University of Illinois – Urbana-Champaign

 In this thesis, we study extremal problems about vertex degrees and a variant of Ramsey number of graphs, and also structural problems about graph decomposition.… (more)

Subjects/Keywords: Vertex degree; graph realization; graph decomposition; tree decomposition; Graham – Haggkvist conjecture; circular chromatic Ramsey number; chromatic Ramsey number; parameter Ramsey number

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Jao, F. (2013). On vertex degrees, graph decomposition, and circular chromatic Ramsey number. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/44320

Chicago Manual of Style (16th Edition):

Jao, Fang-Kai. “On vertex degrees, graph decomposition, and circular chromatic Ramsey number.” 2013. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/44320.

MLA Handbook (7th Edition):

Jao, Fang-Kai. “On vertex degrees, graph decomposition, and circular chromatic Ramsey number.” 2013. Web. 11 Jul 2020.

Vancouver:

Jao F. On vertex degrees, graph decomposition, and circular chromatic Ramsey number. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2013. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/44320.

Council of Science Editors:

Jao F. On vertex degrees, graph decomposition, and circular chromatic Ramsey number. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/44320

25. Yeager, Elyse Christine. Extremal problems in disjoint cycles and graph saturation.

Degree: PhD, Mathematics, 2015, University of Illinois – Urbana-Champaign

 In this thesis, we tackle two main themes: sufficient conditions for the existence of particular subgraphs in a graph, and variations on graph saturation. Determining… (more)

Subjects/Keywords: equitable coloring; cycles; Corradi-Hajnal; Hajnal-Szemeredi; Chen-Lih-Wu; graph saturation; co-criticality; edge-colored saturation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yeager, E. C. (2015). Extremal problems in disjoint cycles and graph saturation. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/78444

Chicago Manual of Style (16th Edition):

Yeager, Elyse Christine. “Extremal problems in disjoint cycles and graph saturation.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/78444.

MLA Handbook (7th Edition):

Yeager, Elyse Christine. “Extremal problems in disjoint cycles and graph saturation.” 2015. Web. 11 Jul 2020.

Vancouver:

Yeager EC. Extremal problems in disjoint cycles and graph saturation. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/78444.

Council of Science Editors:

Yeager EC. Extremal problems in disjoint cycles and graph saturation. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/78444

26. Mahoney, Thomas R. Online choosability of graphs.

Degree: PhD, Mathematics, 2015, University of Illinois – Urbana-Champaign

 We study several problems in graph coloring. In list coloring, each vertex v has a set L(v) of available colors and must be assigned a… (more)

Subjects/Keywords: graph coloring; list coloring; choosability; paintability; online list coloring; online choosability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mahoney, T. R. (2015). Online choosability of graphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/88001

Chicago Manual of Style (16th Edition):

Mahoney, Thomas R. “Online choosability of graphs.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/88001.

MLA Handbook (7th Edition):

Mahoney, Thomas R. “Online choosability of graphs.” 2015. Web. 11 Jul 2020.

Vancouver:

Mahoney TR. Online choosability of graphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/88001.

Council of Science Editors:

Mahoney TR. Online choosability of graphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/88001

27. Santana, Michael L. Extremal problems on cycle structure and colorings of graphs.

Degree: PhD, Mathematics, 2016, University of Illinois – Urbana-Champaign

 In this Thesis, we consider two main themes: conditions that guarantee diverse cycle structure within a graph, and the existence of strong edge-colorings for a… (more)

Subjects/Keywords: graphs; cycles; strong edge-colorings

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Santana, M. L. (2016). Extremal problems on cycle structure and colorings of graphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/92769

Chicago Manual of Style (16th Edition):

Santana, Michael L. “Extremal problems on cycle structure and colorings of graphs.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/92769.

MLA Handbook (7th Edition):

Santana, Michael L. “Extremal problems on cycle structure and colorings of graphs.” 2016. Web. 11 Jul 2020.

Vancouver:

Santana ML. Extremal problems on cycle structure and colorings of graphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/92769.

Council of Science Editors:

Santana ML. Extremal problems on cycle structure and colorings of graphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/92769

28. Lenz, John E. Extremal graph theory: Ramsey-Tur??n numbers, chromatic thresholds, and minors.

Degree: PhD, 0439, 2011, University of Illinois – Urbana-Champaign

 This dissertation investigates several questions in extremal graph theory and the theory of graph minors. It consists of three independent parts; the first two parts… (more)

Subjects/Keywords: Extremal Graph Theory; Turan's Theorem; Minors

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lenz, J. E. (2011). Extremal graph theory: Ramsey-Tur??n numbers, chromatic thresholds, and minors. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/24076

Chicago Manual of Style (16th Edition):

Lenz, John E. “Extremal graph theory: Ramsey-Tur??n numbers, chromatic thresholds, and minors.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/24076.

MLA Handbook (7th Edition):

Lenz, John E. “Extremal graph theory: Ramsey-Tur??n numbers, chromatic thresholds, and minors.” 2011. Web. 11 Jul 2020.

Vancouver:

Lenz JE. Extremal graph theory: Ramsey-Tur??n numbers, chromatic thresholds, and minors. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/24076.

Council of Science Editors:

Lenz JE. Extremal graph theory: Ramsey-Tur??n numbers, chromatic thresholds, and minors. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/24076

29. Zamani Nasab, Reza. Hamiltonian cycles through specified edges in bipartite graphs, domination game, and the game of revolutionaries and spies.

Degree: PhD, 0112, 2011, University of Illinois – Urbana-Champaign

 This thesis deals with the following three independent problems. Po'sa proved that if G is an n-vertex graph in which any two nonadjacent vertices have… (more)

Subjects/Keywords: hamiltonian cycle; bipartite graph; specified edges; domination game; the game of revolutionaries and spies

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zamani Nasab, R. (2011). Hamiltonian cycles through specified edges in bipartite graphs, domination game, and the game of revolutionaries and spies. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/26187

Chicago Manual of Style (16th Edition):

Zamani Nasab, Reza. “Hamiltonian cycles through specified edges in bipartite graphs, domination game, and the game of revolutionaries and spies.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/26187.

MLA Handbook (7th Edition):

Zamani Nasab, Reza. “Hamiltonian cycles through specified edges in bipartite graphs, domination game, and the game of revolutionaries and spies.” 2011. Web. 11 Jul 2020.

Vancouver:

Zamani Nasab R. Hamiltonian cycles through specified edges in bipartite graphs, domination game, and the game of revolutionaries and spies. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/26187.

Council of Science Editors:

Zamani Nasab R. Hamiltonian cycles through specified edges in bipartite graphs, domination game, and the game of revolutionaries and spies. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/26187

30. Wu, Hehui. Extremal problems on cycles, packing, and decomposition of graphs.

Degree: PhD, 0439, 2011, University of Illinois – Urbana-Champaign

 In this thesis, we study extremal problems concerning cycles and paths in graphs, graph packing, and graph decomposition. We use “graph” in the general sense,… (more)

Subjects/Keywords: Graph; circumference; Steiner tree; packing S-connector; independent number; connectivity; decomposition; fractional arborictiy.

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wu, H. (2011). Extremal problems on cycles, packing, and decomposition of graphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/26227

Chicago Manual of Style (16th Edition):

Wu, Hehui. “Extremal problems on cycles, packing, and decomposition of graphs.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/26227.

MLA Handbook (7th Edition):

Wu, Hehui. “Extremal problems on cycles, packing, and decomposition of graphs.” 2011. Web. 11 Jul 2020.

Vancouver:

Wu H. Extremal problems on cycles, packing, and decomposition of graphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/26227.

Council of Science Editors:

Wu H. Extremal problems on cycles, packing, and decomposition of graphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/26227

[1] [2]

.