Results 261 to 270 of about 569,825 (280)
Some of the next articles are maybe not open access.
On 3-colorings of Plane Graphs
Acta Mathematicae Applicatae Sinica, English Series, 2004The main result of the paper states that any \(3\)-colouring of the vertices of a face of degree at least \(11\) in a planar graph \(G\) without cycles of length \(4\), \(5\) and \(7\) and with no pair of intersecting triangles (i.e. every two 3-cycles of \(G\) are vertex-disjoint) can be extended to a \(3\)-colouring of the whole graph \(G\).
openaire +1 more source
An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
European Journal of Operational Research, 2021Oylum Şeker +2 more
exaly
Detecting and Mitigating DDoS Attacks in SDN Using Spatial-Temporal Graph Convolutional Network
IEEE Transactions on Dependable and Secure Computing, 2022Yongyi Cao, Hao Jiang, Yuchuan Deng
exaly
A cutting plane algorithm for graph coloring
Discrete Applied Mathematics, 2008Isabel Mendez-Diaz, Paula Zabala
exaly
Advances and Applications in Discrete Mathematics, 2020
Ashkenazi, Yehuda, Busharyan, Ruth
openaire +1 more source
Ashkenazi, Yehuda, Busharyan, Ruth
openaire +1 more source
Every Plane Graph of Maximum Degree 8 has an Edge-Face 9-Coloring
SIAM Journal on Discrete Mathematics, 2011Ross J. Kang
exaly
Graph Data Anonymization, De-Anonymization Attacks, and De-Anonymizability Quantification: A Survey
IEEE Communications Surveys and Tutorials, 2017Shouling Ji +2 more
exaly