Výsledky vyhľadávania - "Graphs and combinatorics"

A characterization of horizontal visibility graphs and combinatorics on words Autor Gutin, Gregory, Mansour, Toufik, Severini, Simone

“…A Horizontal Visibility Graph (HVG) is defined in association with an ordered set of non-negative reals. HVGs realize a methodology in the analysis of time…”
Získať plný text

Erratum to: Some Graphs with Double Domination Subdivision Number Three Autor Wang, Haoli, Xu, Xirong, Yang, Yuansheng, Zhang, Baosheng

Získať plný text

The 2002 Korea-Hungary Joint Workshop on Combinatorics and The 2002 Com2MaC Conference on Graphs and Combinatorics Autor ARCHDEACON, Dan, KATONA, Gyula O. H, KWAK, Jin Ho

Získať plný text

A characterization of horizontal visibility graphs and combinatorics on words Autor Gutin, Gregory, Mansour, Toufik, Severini, Simone

“…An Horizontal Visibility Graph (for short, HVG) is defined in association with an ordered set of non-negative reals. HVGs realize a methodology in the analysis…”
Získať plný text

b-Coloring Parameterized by Clique-Width Autor Jaffke, Lars, Lima, Paloma T., Lokshtanov, Daniel

“… (Graphs and Combinatorics 25 (2), 153–167, 2009 ). This constitutes the first result concerning structural parameterizations of this problem…”
Získať plný text

On total chromatic number of complete multipartite graphs Autor Dalal, Aseem, Panda, B.S.

“… (Graphs and Combinatorics (2015), 1–15) introduced an approach…”
Získať plný text

Noncrossing Longest Paths and Cycles: Noncrossing Longest Paths and Cycles Autor Aloupis, Greg, Biniaz, Ahmad, Bose, Prosenjit, De Carufel, Jean-Lou, Eppstein, David, Maheshwari, Anil, Odak, Saeed, Smid, Michiel, Tóth, Csaba D., Valtr, Pavel

“…, Álvarez-Rebollar, Cravioto-Lagos, Marín, Solé-Pi, and Urrutia (Graphs and Combinatorics, 2024…”
Získať plný text

Algebraic Connectivity of Power Graphs of Finite Cyclic Groups Autor Rather, Bilal Ahmad

“… That answers a conjecture by Panda, Graphs and Combinatorics, (2019)…”
Získať plný text

The Tight Bound for the Strong Chromatic Indices of Claw-Free Subcubic Graphs Autor Lin, Yuquan, Lin, Wensong

“… [Graphs and Combinatorics 38 (3) (2022) 63] proved that if G is a claw-free subcubic graph other than the triangular prism then χ s ′ ( G ) ≤ 8…”
Získať plný text

A Note on Dominating Pair Degree Condition for Hamiltonian Cycles in Balanced Bipartite Digraphs Autor Wang, Ruixia

“… { x , y } dominating; if z → x and z → y , then we call the pair { x , y } dominated. In 2017, Adamus [Graphs and Combinatorics, 33…”
Získať plný text

A class of graphs with large rankwidth Autor Hoàng, Chính T., Trotignon, Nicolas

“…). Korpelainen, Lozin, and Mayhill [Split permutation graphs, Graphs and Combinatorics, 30(3):633–646, 2014] proved that there exist split graphs with Dilworth number 2 with arbitrarily large rankwidth, but without explicitly constructing…”
Získať plný text

Neighbor sum distinguishing index of -minor free graphs Autor Yang, Wei, Wu, Baoyindureng

“…A proper [ k ]-edge coloring of a graph G is a proper edge coloring of G using colors from . The neighbor set distinguishing index ndi ( G ) of G is the…”
Získať plný text

Characterization of certain families of modular multiplicative divisor graphs Autor Revathi, R., Ganesh, S.

“… This result is a solution to the open problem posed by G. Sethuraman in AKCE International Journal of Graphs and Combinatorics, No. 1 (2009) 229–236…”
Získať plný text

Total coloring of planar graphs of maximum degree eight Autor Roussel, Nicolas, Zhu, Xuding

“… ) . It is known that if a planar graph G has maximum degree Δ ⩾ 9 , then χ ″ ( G ) = Δ + 1 . Recently Hou et al. (Graphs and Combinatorics 24…”
Získať plný text

Cops and Robber - When Capturing is not Surrounding Autor Jungeblut, Paul, Schneider, Samuel, Ueckerdt, Torsten

“…We consider "surrounding" versions of the classic Cops and Robber game. The game is played on a connected graph in which two players, one controlling several…”
Získať plný text

Drawing colored graphs on colored points Autor Badent, Melanie, Di Giacomo, Emilio, Liotta, Giuseppe

“… Wenger, Embedding planar graphs at fixed vertex locations, Graphs and Combinatorics 17 (2001) 717–728…”
Získať plný text

On pseudo-convex partitions of a planar point set Autor Bhattacharya, Bhaswar B., Das, Sandip

“…Aichholzer et al. [O. Aichholzer, C. Huemer, S. Kappes, B. Speckmann, C.D. Tóth, Decompositions, partitions, and coverings with convex polygons and pseudo-triangles, Graphs and Combinatorics 23 (2007) 481–507…”
Získať plný text

A note on improper DP-colouring of planar graphs Autor Cai, Hongyan, Sun, Qiang

“… Recently, Pongpat and Kittikorn [P. Sittitrai and K. Nakprasit, Suffficient conditions on planar graphs to have a relaxed DP-3-colourability, Graphs and Combinatorics 35 (2019), pp. 837-845…”
Získať plný text

Split lattice paths and Rogers-Ramanujan type identities: Split lattice paths and RR type identities Autor Marwah, Bhanu, Goyal, Megha

“…In this paper, an open problem posed by the second author [On $q$-series and split lattice paths, Graphs and Combinatorics, 2020] is addressed…”
Získať plný text

Brooks’ Type Theorem for Indicated Coloring Game: Brooks’ Type Theorem for Indicated Autor Kawabe, Haruki, Kobayashi, Yosuke, Kojima, Shieri, Ozeki, Kenta

“…An indicated coloring game on a graph G is a variant of a coloring game, which is played by two players, Ann and Ben, with a fixed color set. In each round,…”
Získať plný text