Results 71 to 80 of about 11,475 (265)

Temporal Ramsey Graphs: The Ramsey Kinematic Approach to the Motion of Systems of Material Points

Dynamics
The Ramsey approach is applied to analyses of the kinematics of systems built of non-relativistic, motile point masses/particles. This approach is based on colored graph theory. Point masses/particles serve as the vertices of the graph.
Edward Bormashenko
doaj   +1 more source

Parameterized Algorithms for Modular-Width

, 2013
It is known that a number of natural graph problems which are FPT parameterized by treewidth become W-hard when parameterized by clique-width. It is therefore desirable to find a different structural graph parameter which is as general as possible ...
A. Björklund, B. Courcelle, B.-M. Bui-Xuan, F. Protti, F.V. Fomin, H.L. Bodlaender, H.L. Bodlaender, H.L. Bodlaender, H.L. Bodlaender, J. Flum, M. Dom, M. Dom, M. Habib, M. Lampis, M. Tedder, M.R. Fellows, M.R. Fellows, R. Diestel, R. Ganian, R. Ganian, R. Niedermeieri, R.G. Downey, R.M. McConnell, S. Bessy, S. Oum   +24 more
core   +1 more source

An Improved Quasi‐Isometry Between Graphs of Bounded Cliquewidth and Graphs of Bounded Treewidth

Journal of Graph Theory, EarlyView.
ABSTRACT Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi‐isometric to graphs of bounded treewidth.
Marc Distel
wiley   +1 more source

Graph Coloring via Clique Search with Symmetry Breaking [PDF]

, 2022
Sándor Szabó, Bogdán Zaválnij
openalex   +1 more source

On Oriented Colourings of Graphs on Surfaces

Journal of Graph Theory, EarlyView.
ABSTRACT For an oriented graph G $G$, the least number of colours required to oriented colour G $G$ is called the oriented chromatic number of G $G$ and denoted χ o ( G ) ${\chi }_{o}(G)$. For a non‐negative integer g $g$ let χ o ( g ) ${\chi }_{o}(g)$ be the least integer such that χ o ( G ) ≤ χ o ( g ) ${\chi }_{o}(G)\le \unicode{x0200A}{\chi }_{o}(g)
Alexander Clow
wiley   +1 more source

Information-Sharing and Privacy in Social Networks [PDF]

, 2010
We present a new model for reasoning about the way information is shared among friends in a social network, and the resulting ways in which it spreads. Our model formalizes the intuition that revealing personal information in social settings involves a ...
Kleinberg, Jon, Ligett, Katrina
core   +1 more source

Signed Projective Cubes, a Homomorphism Point of View

Journal of Graph Theory, EarlyView.
ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen, Reza Naserasr, Alessandra Sarti   +2 more
wiley   +1 more source

Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs [PDF]

, 2021
Sriram Bhyravarapu, Tim A. Hartmann, Hung P. Hoang, Subrahmanyam Kalyanasundaram, I. Vinod Reddy   +4 more
openalex   +1 more source

Fractional List Packing for Layered Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley   +1 more source

Modified Bron–Kerbosch-Based Sensor Deployment Algorithm for Target Coverage in Wireless Sensor Networks

IEEE Access
The growing adoption of Wireless Sensor Network (WSN) technologies has highlighted several critical factors that are vital for their efficiency and functionality.
P. Surya Bharathi, R. Pavithra
doaj   +1 more source