Computing Square Roots of Graphs With Low Maximum Degree

Discrete Applied Mathematics - Netherlands
doi 10.1016/j.dam.2017.04.041
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Maximum Vertex and Face Degree of Oblique Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

Acyclic Vertex Coloring of Graphs of Maximum Degree 5

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2011English

The Independence Number in Graphs of Maximum Degree Three

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2008English

On 2-Connected Spanning Subgraphs With Low Maximum Degree

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
1998English

A Signature Algorithm Based on DLP and Computing Square Roots

International Journal of Information Technology, Modeling and Computing
2016English

Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2011English

Square Roots of Operators

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1953English

A Sufficient Condition for Planar Graphs With Maximum Degree 6 to Be Totally 8-Colorable

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2017English

Signed Complete Graphs With Maximum Index

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2020English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy