Literatura científica selecionada sobre o tema "2-connected outerplanar graphs"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "2-connected outerplanar graphs".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "2-connected outerplanar graphs"
DRMOTA, MICHAEL, OMER GIMÉNEZ e MARC NOY. "The Maximum Degree of Series-Parallel Graphs". Combinatorics, Probability and Computing 20, n.º 4 (31 de maio de 2011): 529–70. http://dx.doi.org/10.1017/s0963548311000198.
Texto completo da fonteVelona, Vasiliki. "Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs". Discrete Mathematics 341, n.º 12 (dezembro de 2018): 3402–14. http://dx.doi.org/10.1016/j.disc.2018.08.027.
Texto completo da fonteTang, Yunfeng, Huixin Yin e Miaomiao Han. "Star edge coloring of $ K_{2, t} $-free planar graphs". AIMS Mathematics 8, n.º 6 (2023): 13154–61. http://dx.doi.org/10.3934/math.2023664.
Texto completo da fonteBrezovnik, Simon, Niko Tratnik e Petra Žigert Pleteršek. "Resonance Graphs and a Binary Coding of Perfect Matchings of Outerplane Bipartite Graphs". Match Communications in Mathematical and in Computer Chemistry 90, n.º 2 (abril de 2023): 453–68. http://dx.doi.org/10.46793/match.90-2.453b.
Texto completo da fonteLeydold, Josef, e Peter F. Stadler. "Minimal Cycle Bases of Outerplanar Graphs". Electronic Journal of Combinatorics 5, n.º 1 (27 de fevereiro de 1998). http://dx.doi.org/10.37236/1354.
Texto completo da fonteChan, Tsz Lung. "Contractible Edges in 2-Connected Locally Finite Graphs". Electronic Journal of Combinatorics 22, n.º 2 (15 de junho de 2015). http://dx.doi.org/10.37236/4414.
Texto completo da fonteKraus, Veronika. "The degree distribution in unlabelled $2$-connected graph families". Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AM,..., Proceedings (1 de janeiro de 2010). http://dx.doi.org/10.46298/dmtcs.2773.
Texto completo da fonteFeng, Xinge, Xingchao Deng e Junqing Cai. "Anti-van der Waerden Numbers of Some 2-Connected Outerplanar Graphs". Journal of Interconnection Networks, 6 de abril de 2024. http://dx.doi.org/10.1142/s0219265924500051.
Texto completo da fonteLiu, Qi, e Douglas B. West. "Tree-Thickness and Caterpillar-Thickness under Girth Constraints". Electronic Journal of Combinatorics 15, n.º 1 (21 de julho de 2008). http://dx.doi.org/10.37236/817.
Texto completo da fonteDavis, Robert, e Tianran Chen. "Computing Volumes of Adjacency Polytopes via Draconian Sequences". Electronic Journal of Combinatorics 29, n.º 1 (25 de março de 2022). http://dx.doi.org/10.37236/9768.
Texto completo da fonteTeses / dissertações sobre o assunto "2-connected outerplanar graphs"
Dai, Tianjiao. "Some vertex colouring problems and a generalisation of Hamilton-connectivity in graphs". Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG067.
Texto completo da fonteThe decomposition of graphs refers to the process of breaking down a complex graph into simpler, smaller components, often with the goal of analysing or solving problems related to the graph. It is an important tool to display the global structure and properties in a more fine-grained manner, and also useful in solving problems that involve finding specific structures in a graph. There are several common types of graph decomposition techniques that are widely used in graph theory and related fields, including tree decomposition, block decomposition, modular decomposition, hierarchical decomposition, etc. This thesis studies two kinds of vertex decomposition of a graph: proper colourings (decomposition into independent sets) and Hamilton-connectivity (decomposition into internally-disjoint paths between two sets where the paths cover all the vertices of graphs)
Capítulos de livros sobre o assunto "2-connected outerplanar graphs"
Read, Ronald C., e Robin J. Wilson. "Planar Graphs". In An Atlas Of Graphs, 229–62. Oxford University PressOxford, 1998. http://dx.doi.org/10.1093/oso/9780198532897.003.0005.
Texto completo da fonte