Results 71 to 80 of about 1,309,904 (175)

Lower bounds for cube‐ideal set‐systems

Proceedings of the London Mathematical Society, Volume 133, Issue 2, August 2026.
Abstract A set‐system S⊆{0,1}n$S\subseteq \lbrace 0,1\rbrace ^n$ is cube‐ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential lower bounds on the size of cube‐ideal set‐systems, and linear lower bounds on their ...
Ahmad Abdi, Gérard Cornuéjols, Daniel Dadush, Mahsa Dalirrooyfard   +3 more
wiley   +1 more source

The rainbow vertex-index of complementary graphs [PDF]

, 2015
A vertex-colored graph $G$ is \emph{rainbow vertex-connected} if two vertices are connected by a path whose internal vertices have distinct colors. The \emph{rainbow vertex-connection number} of a connected graph $G$, denoted by $rvc(G)$, is the smallest
Ye, Chengfu, Wang, Zhao, Zhang, Shumin, Yanling, Fengnan   +3 more
core  

Inside a duck‐billed dinosaur: Vertebral bone microstructure of Huallasaurus (Hadrosauridae), Upper Cretaceous of Patagonia

The Anatomical Record, Volume 309, Issue 7, Page 1702-1712, July 2026.
Abstract Dinosaurs evolved a unique respiratory system with air sacs that contributed to their evolutionary success. Postcranial skeletal pneumaticity (PSP) has been used to infer the presence of air sac systems in some fossil archosaurs. While unambiguous evidence of PSP is well documented in pterosaurs and post‐Carnian saurischians, it remains absent
Tito Aureliano, Aline M. Ghilardi, Jonatan Kaluza, Agustín G. Martinelli   +3 more
wiley   +1 more source

Vertex Graceful Labeling-Some Path Related Graphs [PDF]

, 2013
Treating subjects as vertex graceful graphs, vertex graceful labeling, caterpillar, actinia graphs, Smarandachely vertex m ...
Balaganesan, P., Renuka, J., Selvaraju, P.   +2 more
core   +1 more source

Rainbow connection number of corona product of graphs

Electronic Journal of Graph Theory and Applications
In an edge-colored graph (where adjacent edges may have the same color), a rainbow path is a path whose edge colors are all distinct. The coloring is called a rainbow coloring if any two vertices can be connected by a rainbow path. The rainbow connection
Fendy Septyanto
doaj   +1 more source

Rainbow Connection Number dan Strong Rainbow Connection Number pada Graf komplemen dari Graf konjugasi grup dihedral [PDF]

, 2017
INDONESIA: Graf G dengan pewarnaan sisi disebut rainbow connected jika setiap titik pada graf G dihubungkan oleh lintasan yang memiliki sisi-sisi dengan warna berbeda.
Indahsari, Alvi Nur Laila
core  

Vertex and edge covers with clustering properties: complexity and algorithms [PDF]

, 2009
We consider the concepts of a t-total vertex cover and a t-total edge cover (t≥1), which generalise the notions of a vertex cover and an edge cover, respectively.
Fernau, Henning, Manlove, David F., Fernau, H., Manlove, D.F.   +3 more
core   +1 more source

Crown reductions for the Minimum Weighted Vertex Cover problem [PDF]

, 2004
The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown rules: some new directions in FPT, in: Proceedings of the 29th International ...
Chlebikova, Janka, Chlebík, Miroslav, Miroslav Chlebík, Chlebik, M., Miroslav Chlebik (4461319), Janka Chlebíková, Janka Chlebíková (16060964)   +6 more
core   +1 more source

Rainbow Connection Number of Octopus Iteration Graphs

InPrime
The rainbow connection number of a graph G denoted by rc(G) is the minimum number of colors used to color the edges in G, such that every pair of vertices is connected by a path with all different colors. In 2008, Chartrand et al.
Desi Rahmadani, Adinda Evelyn Giyanatta, Dina Pratiwi, Mahmuddin Yunus, Vita Kusumasari   +4 more
doaj   +1 more source

Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph

, 2011
6 ...
Chen, Lily, Li, Xueliang, Liu, Mengmeng
openaire   +2 more sources