Bipartite Subgraphs of Graphs with Maximum Degree Three

Stanisław Bylka; Adam Idzik; Jan Komar

doi:10.1007/s003730050047

ScienceGate Book Chapters

JOURNAL ARTICLE

Bipartite Subgraphs of Graphs with Maximum Degree Three

Stanisław Bylka Adam Idzik Jan Komar

Year: 1999 Journal: Graphs and Combinatorics Vol: 15 (2)Pages: 129-136 Publisher: Springer Science+Business Media

DOI: 10.1007/s003730050047

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Mathematics Bipartite graph Degree (music) Induced subgraph Discrete mathematics Cograph Split graph Graph Cardinality (data modeling) Chordal graph 1-planar graph Vertex (graph theory) Computer science

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.15

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Graph theory and applications

Physical Sciences → Mathematics → Geometry and Topology

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Bipartite Subgraphs of Graphs with Maximum Degree Three

Metrics

Citation History

Topics

Related Documents

Largest bipartite subgraphs in triangle‐free graphs with maximum degree three

Maximum bipartite subgraphs of Kneser graphs

Maximum bipartite subgraphs in $H$-free graphs

Maximum Bipartite Subgraphs of Geometric Intersection Graphs

Maximum bipartite subgraphs in graphs without short cycles