Note on strict-double-bound graphs and numbers

zbMATH Open1310.05146MaRDI QIDQ2255453FDOQ2255453

Authors: Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya 

Publication date: 16 February 2015

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Recommendations

• On strict-double-bound numbers of complete graphs missing four edges
• On strict-double-bound numbers of graphs and cut sets
• Note on strict-double-bound numbers of nearly complete graphs missing some edges
• On strict-double-bound numbers of spiders and ladders
• On strict-double-bound numbers of complete graphs without edges of stars and pans

zbMATH Keywords

strict-double-bound graphstrict-double-bound numberdouble bound graph

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (14)

• On strict-double-bound numbers of complete graphs missing four edges
• Strict refinement for graphs and digraphs
• Posets with series parallel orders and strict-double-bound graphs
• On strict-double-bound numbers of complete graphs without edges of stars and pans
• On strict-double-bound numbers of graphs and graph operations
• Note on strict-double-bound numbers of paths, cycles, and wheels
• On double bound graphs and forbidden subposets
• On strict-double-bound graphs and Cartesian products of paths and cycles
• Title not available (Why is that?)
• On strict-double-bound numbers of graphs and cut sets
• On strict-double-bound numbers of complete pseudo-regular trees
• Note on strict-double-bound numbers of nearly complete graphs missing some edges
• On strict-double-bound numbers of caterpillars
• On strict-double-bound numbers of spiders and ladders

This page was built for publication: Note on strict-double-bound graphs and numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2255453)