Vertex Decompositions of Sparse Graphs Into an Edgeless Subgraph and a Subgraph of Maximum Degree at Most K

Journal of Graph Theory - United States
doi 10.1002/jgt.20467
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Wiley

Related search

Variance of the Subgraph Count for Sparse Erdős–Rényi Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2010English

PTAS for Densest K-Subgraph in Interval Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

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

A Branch-And-Cut Algorithm for the Maximum K-Balanced Subgraph of a Signed Graph

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Integral Regular Net-Balanced Signed Graphs With Vertex Degree at Most Four

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2019English

Subgraph Conditions for Hamiltonian Properties of Graphs

English

A Semi-Induced Subgraph Characterization of Upper Domination Perfect Graphs

Journal of Graph Theory
GeometryTopology
1999English

Mining Frequent Subgraph Patterns From Uncertain Graphs

Ruan Jian Xue Bao/Journal of Software
Software
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy