Nearly bipartite graphs (Q1412666): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the connection between chromatic number, maximal clique and minimal degree of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4398864 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cycles of even length in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4071278 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4873821 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On maximal paths and circuits of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs without short odd cycles are nearly bipartite / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: ODD Cycles of Specified Length in Non-Bipartite Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Arithmetic Progressions of Cycle Lengths in Graphs / rank | |||
Normal rank |
Revision as of 11:55, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Nearly bipartite graphs |
scientific article |
Statements
Nearly bipartite graphs (English)
0 references
25 November 2003
0 references
Odd cycle lengths
0 references
Minimal degree
0 references
Nearly bipartite graphs
0 references
0 references